CINXE.COM
Search results for: 1992 consensus
<!DOCTYPE html> <html lang="en" dir="ltr"> <head> <!-- Google tag (gtag.js) --> <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> <!-- Yandex.Metrika counter --> <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> <!-- /Yandex.Metrika counter --> <!-- Matomo --> <!-- End Matomo Code --> <title>Search results for: 1992 consensus</title> <meta name="description" content="Search results for: 1992 consensus"> <meta name="keywords" content="1992 consensus"> <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="1992 consensus" 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="1992 consensus"> <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> 583</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: 1992 consensus</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">583</span> Consensus Problem of High-Order Multi-Agent Systems under Predictor-Based Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cheng-Lin%20Liu">Cheng-Lin Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Fei%20Liu"> Fei Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For the multi-agent systems with agent's dynamics described by high-order integrator, and usual consensus algorithm composed of the state coordination control parts is proposed. Under communication delay, consensus algorithm in asynchronously-coupled form just can make the agents achieve a stationary consensus, and sufficient consensus condition is obtained based on frequency-domain analysis. To recover the original consensus state of the high-order agents without communication delay, besides, a predictor-based consensus algorithm is constructed via multiplying the delayed neighboring agents' states by a delay-related compensation part, and sufficient consensus condition is also obtained. Simulation illustrates the correctness of the results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=high-order%20dynamic%20agents" title="high-order dynamic agents">high-order dynamic agents</a>, <a href="https://publications.waset.org/abstracts/search?q=communication%20delay" title=" communication delay"> communication delay</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus" title=" consensus"> consensus</a>, <a href="https://publications.waset.org/abstracts/search?q=predictor-based%20algorithm" title=" predictor-based algorithm"> predictor-based algorithm</a> </p> <a href="https://publications.waset.org/abstracts/19075/consensus-problem-of-high-order-multi-agent-systems-under-predictor-based-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19075.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">582</span> A Method for Consensus Building between Teachers and Learners in a Value Co-Creative Learning Service</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ryota%20Sugino">Ryota Sugino</a>, <a href="https://publications.waset.org/abstracts/search?q=Satoshi%20Mizoguchi"> Satoshi Mizoguchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Koji%20Kimita"> Koji Kimita</a>, <a href="https://publications.waset.org/abstracts/search?q=Keiichi%20Muramatsu"> Keiichi Muramatsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Tatsunori%20Matsui"> Tatsunori Matsui</a>, <a href="https://publications.waset.org/abstracts/search?q=Yoshiki%20Shimomura"> Yoshiki Shimomura</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Improving added value and productivity of services entails improving both value-in-exchange and value-in-use. Value-in-use is realized by value co-creation, where providers and receivers create value together. In higher education services, value-in-use comes from learners achieving learning outcomes (e.g., knowledge and skills) that are consistent with their learning goals. To enhance the learning outcomes of a learner, it is necessary to enhance and utilize the abilities of the teacher along with the abilities of the learner. To do this, however, the learner and the teacher need to build a consensus about their respective roles. Teachers need to provide effective learning content; learners need to choose the appropriate learning strategies by using the learning content through consensus building. This makes consensus building an important factor in value co-creation. However, methods to build a consensus about their respective roles may not be clearly established, making such consensus difficult. In this paper, we propose some strategies for consensus building between a teacher and a learner in value co-creation. We focus on a teacher and learner co-design and propose an analysis method to clarify a collaborative design process to realize value co-creation. We then analyze some counseling data obtained from a university class. This counseling aimed to build a consensus for value-in-use, learning outcomes, and learning strategies between the teacher and the learner. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=consensus%20building" title="consensus building">consensus building</a>, <a href="https://publications.waset.org/abstracts/search?q=value%20co-creation" title=" value co-creation"> value co-creation</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20education" title=" higher education"> higher education</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20service" title=" learning service"> learning service</a> </p> <a href="https://publications.waset.org/abstracts/38414/a-method-for-consensus-building-between-teachers-and-learners-in-a-value-co-creative-learning-service" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38414.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">303</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">581</span> Middle Management Practices and Leadership in Higher Education, Comparative Case Studies of Two Selected Post-1992 UK Universities </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thouraya%20Eshami">Thouraya Eshami</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this study is to understand, interpret and describe the dynamics of the management and leadership practices with its diverse constituents within the middle management cadre in two selected post-1992 UK universities. The information will be gleaned from interviews conducted with academics who became middle-managers (an AD, SGL and TL) in two selected case Higher Education Institutes. The term middle management is used to describe personnel occupying positions at the level of assistant deans, dean (which also referred to as associate deans), and team leaders. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=academic%20manager" title="academic manager">academic manager</a>, <a href="https://publications.waset.org/abstracts/search?q=associate%20dean" title=" associate dean"> associate dean</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20education" title=" higher education"> higher education</a>, <a href="https://publications.waset.org/abstracts/search?q=middle%20manager" title=" middle manager"> middle manager</a>, <a href="https://publications.waset.org/abstracts/search?q=post%201992%20universities" title=" post 1992 universities"> post 1992 universities</a> </p> <a href="https://publications.waset.org/abstracts/25713/middle-management-practices-and-leadership-in-higher-education-comparative-case-studies-of-two-selected-post-1992-uk-universities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25713.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">580</span> An Investigation Enhancing E-Voting Application Performance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aditya%20Verma">Aditya Verma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> E-voting using blockchain provides us with a distributed system where data is present on each node present in the network and is reliable and secure too due to its immutability property. This work compares various blockchain consensus algorithms used for e-voting applications in the past, based on performance and node scalability, and chooses the optimal one and improves on one such previous implementation by proposing solutions for the loopholes of the optimally working blockchain consensus algorithm, in our chosen application, e-voting. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=blockchain" title="blockchain">blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20bft" title=" parallel bft"> parallel bft</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus%20algorithms" title=" consensus algorithms"> consensus algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=performance" title=" performance"> performance</a> </p> <a href="https://publications.waset.org/abstracts/132393/an-investigation-enhancing-e-voting-application-performance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132393.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">167</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">579</span> Reconfigurable Consensus Achievement of Multi Agent Systems Subject to Actuator Faults in a Leaderless Architecture</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=F.%20Amirarfaei">F. Amirarfaei</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Khorasani"> K. Khorasani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, reconfigurable consensus achievement of a team of agents with marginally stable linear dynamics and single input channel has been considered. The control algorithm is based on a first order linear protocol. After occurrence of a LOE fault in one of the actuators, using the imperfect information of the effectiveness of the actuators from fault detection and identification module, the control gain is redesigned in a way to still reach consensus. The idea is based on the modeling of change in effectiveness as change of Laplacian matrix. Then as special cases of this class of systems, a team of single integrators as well as double integrators are considered and their behavior subject to a LOE fault is considered. The well-known relative measurements consensus protocol is applied to a leaderless team of single integrator as well as double integrator systems, and Gersgorin disk theorem is employed to determine whether fault occurrence has an effect on system stability and team consensus achievement or not. The analyses show that loss of effectiveness fault in actuator(s) of integrator systems affects neither system stability nor consensus achievement. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-agent%20system" title="multi-agent system">multi-agent system</a>, <a href="https://publications.waset.org/abstracts/search?q=actuator%20fault" title=" actuator fault"> actuator fault</a>, <a href="https://publications.waset.org/abstracts/search?q=stability%20analysis" title=" stability analysis"> stability analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus%20achievement" title=" consensus achievement"> consensus achievement</a> </p> <a href="https://publications.waset.org/abstracts/28909/reconfigurable-consensus-achievement-of-multi-agent-systems-subject-to-actuator-faults-in-a-leaderless-architecture" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28909.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">337</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">578</span> Middle-Level Management Involvement in Strategy Process, and Organizational Performance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mazyar%20Taghavi">Mazyar Taghavi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research examines middle-level managers’ involvement in strategy process in 15 manufacturing and service companies in Iran. We considered two dominant theoretical arguments for expecting a positive association. According to the first direction involvement improves organizational performance by improving the quality of strategic decisions. According to the second track, middle managers contribute to increased levels of performance through strategic consensus among them. Results indicate that involvement in the strategy is related to organizational performance. Involvement is associated with consensus (i.e. strategic understanding and commitment) among middle-level managers. However, findings indicate that consensus is not related to the organizational performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=middle-level%20management" title="middle-level management">middle-level management</a>, <a href="https://publications.waset.org/abstracts/search?q=strategy%20process" title=" strategy process"> strategy process</a>, <a href="https://publications.waset.org/abstracts/search?q=organizational%20performance" title=" organizational performance"> organizational performance</a>, <a href="https://publications.waset.org/abstracts/search?q=strategy%20consensus" title=" strategy consensus"> strategy consensus</a> </p> <a href="https://publications.waset.org/abstracts/19006/middle-level-management-involvement-in-strategy-process-and-organizational-performance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19006.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">439</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">577</span> Sync Consensus Algorithm: Trying to Reach an Agreement at Full Speed</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yuri%20Zinchenko">Yuri Zinchenko</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, distributed storage systems have been used more and more in various aspects of everyday life. They provide such necessary properties as Scalability, Fault Tolerance, Durability, and others. At the same time, not only reliable but also fast data storage remains one of the most pressing issues in this area. That brings us to the consensus algorithm as one of the most important components that has a great impact on the functionality of a distributed system. This paper is the result of an analysis of several well-known consensus algorithms, such as Paxos and Raft. The algorithm it offers, called Sync, promotes, but does not insist on simultaneous writing to the nodes (which positively affects the overall writing speed) and tries to minimize the system's inactive time. This allows nodes to reach agreement on the system state in a shorter period, which is a critical factor for distributed systems. Also when developing Sync, a lot of attention was paid to such criteria as simplicity and intuitiveness, the importance of which is difficult to overestimate. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sync" title="sync">sync</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus%20algorithm" title=" consensus algorithm"> consensus algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20system" title=" distributed system"> distributed system</a>, <a href="https://publications.waset.org/abstracts/search?q=leader-based" title=" leader-based"> leader-based</a>, <a href="https://publications.waset.org/abstracts/search?q=synchronization." title=" synchronization."> synchronization.</a> </p> <a href="https://publications.waset.org/abstracts/179045/sync-consensus-algorithm-trying-to-reach-an-agreement-at-full-speed" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/179045.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">62</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">576</span> A Consensus Approach to the Formulation of a School ICT Policy: A Q-Methodology Case Study </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thiru%20Vandeyar">Thiru Vandeyar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study sets out to explore how teachers’ beliefs and attitudes about ICT policy influence a consensus approach to the formulation of a school ICT policy. This case study proposes Q- methodology as an innovative method to facilitate a school’s capacity to develop policy reflecting teacher beliefs and attitudes. Q-methodology is used as a constructivist approach to the formulation of an ICT policy. Data capture was a mix of Q-methodology and qualitative principles. Data was analyzed by means of document, content and cluster analysis methods. Findings were threefold: First, teachers’ beliefs and attitudes about ICT policy influenced a consensus approach by including teachers as policy decision-makers. Second, given the opportunity, teachers have the inherent ability to deconstruct and critically engage with policy statements according to their own professional beliefs and attitudes. And third, an inclusive approach to policy formulation may inform the practice of school leaders and policymakers alike on how schools may develop their own policy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ICT" title="ICT">ICT</a>, <a href="https://publications.waset.org/abstracts/search?q=policy" title=" policy"> policy</a>, <a href="https://publications.waset.org/abstracts/search?q=teacher%20beliefs" title=" teacher beliefs"> teacher beliefs</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus" title=" consensus"> consensus</a> </p> <a href="https://publications.waset.org/abstracts/3087/a-consensus-approach-to-the-formulation-of-a-school-ict-policy-a-q-methodology-case-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3087.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">509</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">575</span> Consensus Reaching Process and False Consensus Effect in a Problem of Portfolio Selection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Viviana%20Ventre">Viviana Ventre</a>, <a href="https://publications.waset.org/abstracts/search?q=Giacomo%20Di%20Tollo"> Giacomo Di Tollo</a>, <a href="https://publications.waset.org/abstracts/search?q=Roberta%20Martino"> Roberta Martino</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The portfolio selection problem includes the evaluation of many criteria that are difficult to compare directly and is characterized by uncertain elements. The portfolio selection problem can be modeled as a group decision problem in which several experts are invited to present their assessment. In this context, it is important to study and analyze the process of reaching a consensus among group members. Indeed, due to the various diversities among experts, reaching consensus is not necessarily always simple and easily achievable. Moreover, the concept of consensus is accompanied by the concept of false consensus, which is particularly interesting in the dynamics of group decision-making processes. False consensus can alter the evaluation and selection phase of the alternative and is the consequence of the decision maker's inability to recognize that his preferences are conditioned by subjective structures. The present work aims to investigate the dynamics of consensus attainment in a group decision problem in which equivalent portfolios are proposed. In particular, the study aims to analyze the impact of the subjective structure of the decision-maker during the evaluation and selection phase of the alternatives. Therefore, the experimental framework is divided into three phases. In the first phase, experts are sent to evaluate the characteristics of all portfolios individually, without peer comparison, arriving independently at the selection of the preferred portfolio. The experts' evaluations are used to obtain individual Analytical Hierarchical Processes that define the weight that each expert gives to all criteria with respect to the proposed alternatives. This step provides insight into how the decision maker's decision process develops, step by step, from goal analysis to alternative selection. The second phase includes the description of the decision maker's state through Markov chains. In fact, the individual weights obtained in the first phase can be reviewed and described as transition weights from one state to another. Thus, with the construction of the individual transition matrices, the possible next state of the expert is determined from the individual weights at the end of the first phase. Finally, the experts meet, and the process of reaching consensus is analyzed by considering the single individual state obtained at the previous stage and the false consensus bias. The work contributes to the study of the impact of subjective structures, quantified through the Analytical Hierarchical Process, and how they combine with the false consensus bias in group decision-making dynamics and the consensus reaching process in problems involving the selection of equivalent portfolios. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analytical%20hierarchical%20process" title="analytical hierarchical process">analytical hierarchical process</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus%20building" title=" consensus building"> consensus building</a>, <a href="https://publications.waset.org/abstracts/search?q=false%20consensus%20effect" title=" false consensus effect"> false consensus effect</a>, <a href="https://publications.waset.org/abstracts/search?q=markov%20chains" title=" markov chains"> markov chains</a>, <a href="https://publications.waset.org/abstracts/search?q=portfolio%20selection%20problem" title=" portfolio selection problem"> portfolio selection problem</a> </p> <a href="https://publications.waset.org/abstracts/147806/consensus-reaching-process-and-false-consensus-effect-in-a-problem-of-portfolio-selection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147806.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">93</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">574</span> New Product Development Typologies: An Analysis of Publications and Citations between 1992 and 2012</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ana%20Paula%20Vilas%20Boas%20Viveiros%20Lopes">Ana Paula Vilas Boas Viveiros Lopes</a>, <a href="https://publications.waset.org/abstracts/search?q=Marly%20Monteiro%20de%20Carvalho"> Marly Monteiro de Carvalho</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The new product development for decades has favored companies that can put their products to market quickly and efficiently, providing sustainable competitive advantage difficult to be achieved by their competitors. This paper presents the outcomes of a systematic review of the literature relating to new product development that was published between 1992 and 2012. A hybrid methodological approach that combines bibliometrics, content analysis and semantic analysis was applied. The review discusses the publication patterns, focusing on aspects related to scientific collaboration. The results show that the main academic journal that discusses this theme is “Journal of Product Innovation Management”. Although the first paper relating to this theme was published in 1992, the number of publications on the subject only began to increase substantially in 1999. Most of the studies reviewed in this paper applied qualitative research methods, indicating that most of the research on the theme is still in an exploratory phase. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=project%20type" title="project type">project type</a>, <a href="https://publications.waset.org/abstracts/search?q=project%20typology" title=" project typology"> project typology</a>, <a href="https://publications.waset.org/abstracts/search?q=new%20product%20development" title=" new product development"> new product development</a>, <a href="https://publications.waset.org/abstracts/search?q=sustainable%20competitive%20advantage" title=" sustainable competitive advantage"> sustainable competitive advantage</a> </p> <a href="https://publications.waset.org/abstracts/6850/new-product-development-typologies-an-analysis-of-publications-and-citations-between-1992-and-2012" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6850.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">448</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">573</span> Robust Stabilization against Unknown Consensus Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Myung-Gon%20Yoon">Myung-Gon Yoon</a>, <a href="https://publications.waset.org/abstracts/search?q=Jung-Ho%20Moon"> Jung-Ho Moon</a>, <a href="https://publications.waset.org/abstracts/search?q=Tae%20Kwon%20Ha"> Tae Kwon Ha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers a robust stabilization problem of a single agent in a multi-agent consensus system composed of identical agents, when the network topology of the system is completely unknown. It is shown that the transfer function of an agent in a consensus system can be described as a multiplicative perturbation of the isolated agent transfer function in frequency domain. Applying known robust stabilization results, we present sufficient conditions for a robust stabilization of an agent against unknown network topology. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=single%20agent%20control" title="single agent control">single agent control</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-agent%20system" title=" multi-agent system"> multi-agent system</a>, <a href="https://publications.waset.org/abstracts/search?q=transfer%20function" title=" transfer function"> transfer function</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20angle" title=" graph angle"> graph angle</a> </p> <a href="https://publications.waset.org/abstracts/11150/robust-stabilization-against-unknown-consensus-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11150.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">452</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">572</span> Rank-Based Chain-Mode Ensemble for Binary Classification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chongya%20Song">Chongya Song</a>, <a href="https://publications.waset.org/abstracts/search?q=Kang%20Yen"> Kang Yen</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexander%20Pons"> Alexander Pons</a>, <a href="https://publications.waset.org/abstracts/search?q=Jin%20Liu"> Jin Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the field of machine learning, the ensemble has been employed as a common methodology to improve the performance upon multiple base classifiers. However, the true predictions are often canceled out by the false ones during consensus due to a phenomenon called “curse of correlation” which is represented as the strong interferences among the predictions produced by the base classifiers. In addition, the existing practices are still not able to effectively mitigate the problem of imbalanced classification. Based on the analysis on our experiment results, we conclude that the two problems are caused by some inherent deficiencies in the approach of consensus. Therefore, we create an enhanced ensemble algorithm which adopts a designed rank-based chain-mode consensus to overcome the two problems. In order to evaluate the proposed ensemble algorithm, we employ a well-known benchmark data set NSL-KDD (the improved version of dataset KDDCup99 produced by University of New Brunswick) to make comparisons between the proposed and 8 common ensemble algorithms. Particularly, each compared ensemble classifier uses the same 22 base classifiers, so that the differences in terms of the improvements toward the accuracy and reliability upon the base classifiers can be truly revealed. As a result, the proposed rank-based chain-mode consensus is proved to be a more effective ensemble solution than the traditional consensus approach, which outperforms the 8 ensemble algorithms by 20% on almost all compared metrices which include accuracy, precision, recall, F1-score and area under receiver operating characteristic curve. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=consensus" title="consensus">consensus</a>, <a href="https://publications.waset.org/abstracts/search?q=curse%20of%20correlation" title=" curse of correlation"> curse of correlation</a>, <a href="https://publications.waset.org/abstracts/search?q=imbalance%20classification" title=" imbalance classification"> imbalance classification</a>, <a href="https://publications.waset.org/abstracts/search?q=rank-based%20chain-mode%20ensemble" title=" rank-based chain-mode ensemble"> rank-based chain-mode ensemble</a> </p> <a href="https://publications.waset.org/abstracts/112891/rank-based-chain-mode-ensemble-for-binary-classification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/112891.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">138</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">571</span> Power-Aware Adaptive Coverage Control with Consensus Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mert%20Turanli">Mert Turanli</a>, <a href="https://publications.waset.org/abstracts/search?q=Hakan%20Temeltas"> Hakan Temeltas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a new approach to coverage control problem by using adaptive coordination and power aware control laws. Nonholonomic mobile nodes position themselves suboptimally according to a time-varying density function using Centroidal Voronoi Tesellations. The Lyapunov stability analysis of the adaptive and decentralized approach is given. A linear consensus protocol is used to establish synchronization among the mobile nodes. Also, repulsive forces prevent nodes from collision. Simulation results show that by using power aware control laws, energy consumption of the nodes can be reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=power%20aware" title="power aware">power aware</a>, <a href="https://publications.waset.org/abstracts/search?q=coverage%20control" title=" coverage control"> coverage control</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive" title=" adaptive"> adaptive</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus" title=" consensus"> consensus</a>, <a href="https://publications.waset.org/abstracts/search?q=nonholonomic" title=" nonholonomic"> nonholonomic</a>, <a href="https://publications.waset.org/abstracts/search?q=coordination" title=" coordination"> coordination</a> </p> <a href="https://publications.waset.org/abstracts/34760/power-aware-adaptive-coverage-control-with-consensus-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34760.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">353</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">570</span> SISSLE in Consensus-Based Ripple: Some Improvements in Speed, Security, Last Mile Connectivity and Ease of Use</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mayank%20Mundhra">Mayank Mundhra</a>, <a href="https://publications.waset.org/abstracts/search?q=Chester%20Rebeiro"> Chester Rebeiro</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cryptocurrencies are rapidly finding wide application in areas such as Real Time Gross Settlements and Payments Systems. Ripple is a cryptocurrency that has gained prominence with banks and payment providers. It solves the Byzantine General’s Problem with its Ripple Protocol Consensus Algorithm (RPCA), where each server maintains a list of servers, called Unique Node List (UNL) that represents the network for the server, and will not collectively defraud it. The server believes that the network has come to a consensus when members of the UNL come to a consensus on a transaction. In this paper we improve Ripple to achieve better speed, security, last mile connectivity and ease of use. We implement guidelines and automated systems for building and maintaining UNLs for resilience, robustness, improved security, and efficient information propagation. We enhance the system so as to ensure that each server receives information from across the whole network rather than just from the UNL members. We also introduce the paradigm of UNL overlap as a function of information propagation and the trust a server assigns to its own UNL. Our design not only reduces vulnerabilities such as eclipse attacks, but also makes it easier to identify malicious behaviour and entities attempting to fraudulently Double Spend or stall the system. We provide experimental evidence of the benefits of our approach over the current Ripple scheme. We observe ≥ 4.97x and 98.22x in speedup and success rate for information propagation respectively, and ≥ 3.16x and 51.70x in speedup and success rate in consensus. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ripple" title="Ripple">Ripple</a>, <a href="https://publications.waset.org/abstracts/search?q=Kelips" title=" Kelips"> Kelips</a>, <a href="https://publications.waset.org/abstracts/search?q=unique%20node%20list" title=" unique node list"> unique node list</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus" title=" consensus"> consensus</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20propagation" title=" information propagation"> information propagation</a> </p> <a href="https://publications.waset.org/abstracts/130100/sissle-in-consensus-based-ripple-some-improvements-in-speed-security-last-mile-connectivity-and-ease-of-use" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/130100.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">145</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">569</span> The Perils of Flagging Pirates: How Gender, False Consensus and Normative Messages Influence Digital Piracy Intentions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kate%20Whitman">Kate Whitman</a>, <a href="https://publications.waset.org/abstracts/search?q=Zahra%20Murad"> Zahra Murad</a>, <a href="https://publications.waset.org/abstracts/search?q=Joe%20Cox"> Joe Cox</a>, <a href="https://publications.waset.org/abstracts/search?q=Adam%20Cox"> Adam Cox</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study investigates the influence of normative communications on digital piracy intentions. Although descriptive norms are thought to influence behavior, the study examines the potential bias in one's own behavior, leading to false consensus—a phenomenon perpetuating undesirable activities. The research tests the presence of false consensus and the effect of correcting normative predictions on changes in piracy intentions, examining gender differences. Results from a controlled experiment (N = 684) indicate that normative communications, reflecting the "real" norm based on government data (N=5000), increase (decrease) piracy intentions among men (women) underestimating their peers' behavior. Conversely, neither men nor women overestimating their peers' piracy show any notable change in intentions. Considering men consume more illegal content than women, suggesting they pose a higher risk, the study highlights the need for cautious use of normative communications. Therefore, policymakers should minimize the visibility of piracy behavior for effective digital piracy management. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20piracy" title="digital piracy">digital piracy</a>, <a href="https://publications.waset.org/abstracts/search?q=false%20consensus" title=" false consensus"> false consensus</a>, <a href="https://publications.waset.org/abstracts/search?q=normative%20interventions" title=" normative interventions"> normative interventions</a>, <a href="https://publications.waset.org/abstracts/search?q=persuasive%20messages" title=" persuasive messages"> persuasive messages</a> </p> <a href="https://publications.waset.org/abstracts/182037/the-perils-of-flagging-pirates-how-gender-false-consensus-and-normative-messages-influence-digital-piracy-intentions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/182037.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">59</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">568</span> Taiwan’s Democratic Institutions: The Electoral Rise and Recall of Kuomintang’s Han Kuo-YU Mayor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ryan%20Brading">Ryan Brading</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The results of Taiwan’s presidential election, which took place on 11 January 2020, were alarming for the Kuomintang (KMT). A party that was once the pillar of Taiwan’s institutional apparatus is now losing its direction. Since 2016, the inability of KMT to construct a winning presidential election campaign strategy has made its Chinese ancestry an obstacle in Taiwan’s vibrant and transparent democracy. The appearance of the little-known legislator Han Kuo-yu as the leadership alternative opened the possibility of reigniting the party. Han’s victory in the Kaohsiung mayoral election in November 2018 provided hope that Han could also win the presidency. Wrongly described as a populist, Han, however, was defeated in the January 2020 presidential race. This article analyses why Han is not a populist, his triumph in Kaohsiung, humiliation in running for the presidency and suffering a complete ‘loss of face’ when Kaohsiungers democratically ousted him from the mayoral post on 6 June 2020. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=populism" title="populism">populism</a>, <a href="https://publications.waset.org/abstracts/search?q=1992%20consensus" title=" 1992 consensus"> 1992 consensus</a>, <a href="https://publications.waset.org/abstracts/search?q=youth%20vote" title=" youth vote"> youth vote</a>, <a href="https://publications.waset.org/abstracts/search?q=Taiwan" title=" Taiwan"> Taiwan</a>, <a href="https://publications.waset.org/abstracts/search?q=recall" title=" recall"> recall</a> </p> <a href="https://publications.waset.org/abstracts/144351/taiwans-democratic-institutions-the-electoral-rise-and-recall-of-kuomintangs-han-kuo-yu-mayor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144351.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">567</span> Group Consensus of Hesitant Fuzzy Linguistic Variables for Decision-Making Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chen%20T.%20Chen">Chen T. Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Hui%20L.%20Cheng"> Hui L. Cheng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to the different knowledge, experience and expertise of experts, they usually provide the different opinions in the group decision-making process. Therefore, it is an important issue to reach the group consensus of opinions of experts in group multiple-criteria decision-making (GMCDM) process. Because the subjective opinions of experts always are fuzziness and uncertainties, it is difficult to use crisp values to describe the real opinions of experts or decision-makers. It is reasonable for experts to use the linguistic variables to express their opinions. The hesitant fuzzy set are extended from the concept of fuzzy sets. Experts use the hesitant fuzzy sets can be flexible to describe their subjective opinions. In order to aggregate the hesitant fuzzy linguistic variables of all experts effectively, an adjustment method based on distance function will be presented in this paper. Based on the opinions adjustment method, this paper will present an effective approach to adjust the hesitant fuzzy linguistic variables of all experts to reach the group consensus. Then, a new hesitant linguistic GMCDM method will be presented based on the group consensus of hesitant fuzzy linguistic variables. Finally, an example will be implemented to illustrate the computational process to enhance the practical value of the proposed model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=group%20multi-criteria%20decision-making" title="group multi-criteria decision-making">group multi-criteria decision-making</a>, <a href="https://publications.waset.org/abstracts/search?q=linguistic%20variables" title=" linguistic variables"> linguistic variables</a>, <a href="https://publications.waset.org/abstracts/search?q=hesitant%20fuzzy%20linguistic%20variables" title=" hesitant fuzzy linguistic variables"> hesitant fuzzy linguistic variables</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20function" title=" distance function"> distance function</a>, <a href="https://publications.waset.org/abstracts/search?q=group%20consensus" title=" group consensus "> group consensus </a> </p> <a href="https://publications.waset.org/abstracts/123438/group-consensus-of-hesitant-fuzzy-linguistic-variables-for-decision-making-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/123438.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">566</span> Model-Free Distributed Control of Dynamical Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Javad%20Khazaei">Javad Khazaei</a>, <a href="https://publications.waset.org/abstracts/search?q=Rick%20Blum"> Rick Blum</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Distributed control is an efficient and flexible approach for coordination of multi-agent systems. One of the main challenges in designing a distributed controller is identifying the governing dynamics of the dynamical systems. Data-driven system identification is currently undergoing a revolution. With the availability of high-fidelity measurements and historical data, model-free identification of dynamical systems can facilitate the control design without tedious modeling of high-dimensional and/or nonlinear systems. This paper develops a distributed control design using consensus theory for linear and nonlinear dynamical systems using sparse identification of system dynamics. Compared with existing consensus designs that heavily rely on knowing the detailed system dynamics, the proposed model-free design can accurately capture the dynamics of the system with available measurements and input data and provide guaranteed performance in consensus and tracking problems. Heterogeneous damped oscillators are chosen as examples of dynamical system for validation purposes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=consensus%20tracking" title="consensus tracking">consensus tracking</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20control" title=" distributed control"> distributed control</a>, <a href="https://publications.waset.org/abstracts/search?q=model-free%20control" title=" model-free control"> model-free control</a>, <a href="https://publications.waset.org/abstracts/search?q=sparse%20identification%20of%20dynamical%20systems" title=" sparse identification of dynamical systems"> sparse identification of dynamical systems</a> </p> <a href="https://publications.waset.org/abstracts/144452/model-free-distributed-control-of-dynamical-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144452.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">265</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">565</span> Electroencephalography-Based Intention Recognition and Consensus Assessment during Emergency Response</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Siyao%20Zhu">Siyao Zhu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yifang%20Xu"> Yifang Xu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> After natural and man-made disasters, robots can bypass the danger, expedite the search, and acquire unprecedented situational awareness to design rescue plans. The hands-free requirement from the first responders excludes the use of tedious manual control and operation. In unknown, unstructured, and obstructed environments, natural-language-based supervision is not amenable for first responders to formulate, and is difficult for robots to understand. Brain-computer interface is a promising option to overcome the limitations. This study aims to test the feasibility of using electroencephalography (EEG) signals to decode human intentions and detect the level of consensus on robot-provided information. EEG signals were classified using machine-learning and deep-learning methods to discriminate search intentions and agreement perceptions. The results show that the average classification accuracy for intention recognition and consensus assessment is 67% and 72%, respectively, proving the potential of incorporating recognizable users’ bioelectrical responses into advanced robot-assisted systems for emergency response. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=consensus%20assessment" title="consensus assessment">consensus assessment</a>, <a href="https://publications.waset.org/abstracts/search?q=electroencephalogram" title=" electroencephalogram"> electroencephalogram</a>, <a href="https://publications.waset.org/abstracts/search?q=emergency%20response" title=" emergency response"> emergency response</a>, <a href="https://publications.waset.org/abstracts/search?q=human-robot%20collaboration" title=" human-robot collaboration"> human-robot collaboration</a>, <a href="https://publications.waset.org/abstracts/search?q=intention%20recognition" title=" intention recognition"> intention recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=search%20and%20rescue" title=" search and rescue"> search and rescue</a> </p> <a href="https://publications.waset.org/abstracts/151629/electroencephalography-based-intention-recognition-and-consensus-assessment-during-emergency-response" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151629.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">93</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">564</span> Implementation of Proof of Work Using Ganache</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sakshi%20Singh">Sakshi Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Shampa%20Chakraverty"> Shampa Chakraverty</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the essential characteristics of Blockchain is the ability to validate the integrity of new transactions added to the Blockchain. Moreover, one of the essential consensus algorithms, Proof of Work, performs this job. In this work, we implemented the Proof of Work consensus method on the block formed by performing the transaction using Ganache. The primary goal of this implementation is to understand the process and record how Proof of Work works in reality on newly created blocks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=proof%20of%20work" title="proof of work">proof of work</a>, <a href="https://publications.waset.org/abstracts/search?q=blockchain" title=" blockchain"> blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=ganache" title=" ganache"> ganache</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20contract" title=" smart contract"> smart contract</a> </p> <a href="https://publications.waset.org/abstracts/154576/implementation-of-proof-of-work-using-ganache" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154576.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">166</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">563</span> Research on Dynamic Practical Byzantine Fault Tolerance Consensus Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cao%20Xiaopeng">Cao Xiaopeng</a>, <a href="https://publications.waset.org/abstracts/search?q=Shi%20Linkai"> Shi Linkai </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The practical Byzantine fault-tolerant algorithm does not add nodes dynamically. It is limited in practical application. In order to add nodes dynamically, Dynamic Practical Byzantine Fault Tolerance Algorithm (DPBFT) was proposed. Firstly, a new node sends request information to other nodes in the network. The nodes in the network decide their identities and requests. Then the nodes in the network reverse connect to the new node and send block information of the current network. The new node updates information. Finally, the new node participates in the next round of consensus, changes the view and selects the master node. This paper abstracts the decision of nodes into the undirected connected graph. The final consistency of the graph is used to prove that the proposed algorithm can adapt to the network dynamically. Compared with the PBFT algorithm, DPBFT has better fault tolerance and lower network bandwidth. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=practical%20byzantine" title="practical byzantine">practical byzantine</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20tolerance" title=" fault tolerance"> fault tolerance</a>, <a href="https://publications.waset.org/abstracts/search?q=blockchain" title=" blockchain"> blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus%20algorithm" title=" consensus algorithm"> consensus algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=consistency%20analysis" title=" consistency analysis"> consistency analysis</a> </p> <a href="https://publications.waset.org/abstracts/128883/research-on-dynamic-practical-byzantine-fault-tolerance-consensus-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128883.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">130</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">562</span> Blockchain’s Feasibility in Military Data Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Brenden%20M.%20Shutt">Brenden M. Shutt</a>, <a href="https://publications.waset.org/abstracts/search?q=Lubjana%20Beshaj"> Lubjana Beshaj</a>, <a href="https://publications.waset.org/abstracts/search?q=Paul%20L.%20Goethals"> Paul L. Goethals</a>, <a href="https://publications.waset.org/abstracts/search?q=Ambrose%20Kam"> Ambrose Kam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Communication security is of particular interest to military data networks. A relatively novel approach to network security is blockchain, a cryptographically secured distribution ledger with a decentralized consensus mechanism for data transaction processing. Recent advances in blockchain technology have proposed new techniques for both data validation and trust management, as well as different frameworks for managing dataflow. The purpose of this work is to test the feasibility of different blockchain architectures as applied to military command and control networks. Various architectures are tested through discrete-event simulation and the feasibility is determined based upon a blockchain design’s ability to maintain long-term stable performance at industry standards of throughput, network latency, and security. This work proposes a consortium blockchain architecture with a computationally inexpensive consensus mechanism, one that leverages a Proof-of-Identity (PoI) concept and a reputation management mechanism. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=blockchain" title="blockchain">blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus%20mechanism" title=" consensus mechanism"> consensus mechanism</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete-event%20simulation" title=" discrete-event simulation"> discrete-event simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=fog%20computing" title=" fog computing"> fog computing</a> </p> <a href="https://publications.waset.org/abstracts/130951/blockchains-feasibility-in-military-data-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/130951.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">138</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">561</span> Observer-Based Leader-Following Consensus of Nonlinear Fractional-Order Multi-Agent Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Afaghi">Ali Afaghi</a>, <a href="https://publications.waset.org/abstracts/search?q=Sehraneh%20Ghaemi"> Sehraneh Ghaemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The coordination of the multi-agent systems has been one of the interesting topic in recent years, because of its potential applications in many branches of science and engineering such as sensor networks, flocking, underwater vehicles and etc. In the most of the related studies, it is assumed that the dynamics of the multi-agent systems are integer-order and linear and the multi-agent systems with the fractional-order nonlinear dynamics are rarely considered. However many phenomena in nature cannot be described within integer-order and linear characteristics. This paper investigates the leader-following consensus problem for a class of nonlinear fractional-order multi-agent systems based on observer-based cooperative control. In the system, the dynamics of each follower and leader are nonlinear. For a multi-agent system with fixed directed topology firstly, an observer-based consensus protocol is proposed based on the relative observer states of neighboring agents. Secondly, based on the property of the stability theory of fractional-order system, some sufficient conditions are presented for the asymptotical stability of the observer-based fractional-order control systems. The proposed method is applied on a five-agent system with the fractional-order nonlinear dynamics and unavailable states. The simulation example shows that the proposed scenario results in the good performance and can be used in many practical applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fractional-order%20multi-agent%20systems" title="fractional-order multi-agent systems">fractional-order multi-agent systems</a>, <a href="https://publications.waset.org/abstracts/search?q=leader-following%20consensus" title=" leader-following consensus"> leader-following consensus</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20dynamics" title=" nonlinear dynamics"> nonlinear dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=directed%20graphs" title=" directed graphs"> directed graphs</a> </p> <a href="https://publications.waset.org/abstracts/67272/observer-based-leader-following-consensus-of-nonlinear-fractional-order-multi-agent-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67272.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">398</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">560</span> Reliable Consensus Problem for Multi-Agent Systems with Sampled-Data </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20H.%20Lee">S. H. Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20J.%20Park"> M. J. Park</a>, <a href="https://publications.waset.org/abstracts/search?q=O.%20M.%20Kwon"> O. M. Kwon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, reliable consensus of multi-agent systems with sampled-data is investigated. By using a suitable Lyapunov-Krasovskii functional and some techniques such as Wirtinger Inequality, Schur Complement and Kronecker Product, the results of this systems are obtained by solving a set of Linear Matrix Inequalities(LMIs). One numerical example is included to show the effectiveness of the proposed criteria. <p class="card-text"><strong>Keywords:</strong> <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=linear%20matrix%20inequalities%20%28LMIs%29" title=" linear matrix inequalities (LMIs)"> linear matrix inequalities (LMIs)</a>, <a href="https://publications.waset.org/abstracts/search?q=kronecker%20product" title=" kronecker product"> kronecker product</a>, <a href="https://publications.waset.org/abstracts/search?q=sampled-data" title=" sampled-data"> sampled-data</a>, <a href="https://publications.waset.org/abstracts/search?q=Lyapunov%20method" title=" Lyapunov method"> Lyapunov method</a> </p> <a href="https://publications.waset.org/abstracts/25582/reliable-consensus-problem-for-multi-agent-systems-with-sampled-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25582.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">528</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">559</span> A Genetic Algorithm Based Ensemble Method with Pairwise Consensus Score on Malware Cacophonous Labels</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shih-Yu%20Wang">Shih-Yu Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Shun-Wen%20Hsiao"> Shun-Wen Hsiao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the field of cybersecurity, there exists many vendors giving malware samples classified results, namely naming after the label that contains some important information which is also called AV label. Lots of researchers relay on AV labels for research. Unfortunately, AV labels are too cluttered. They do not have a fixed format and fixed naming rules because the naming results were based on each classifiers' viewpoints. A way to fix the problem is taking a majority vote. However, voting can sometimes create problems of bias. Thus, we create a novel ensemble approach which does not rely on the cacophonous naming result but depend on group identification to aggregate everyone's opinion. To achieve this purpose, we develop an scoring system called Pairwise Consensus Score (PCS) to calculate result similarity. The entire method architecture combine Genetic Algorithm and PCS to find maximum consensus in the group. Experimental results revealed that our method outperformed the majority voting by 10% in term of the score. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=ensemble%20learning" title=" ensemble learning"> ensemble learning</a>, <a href="https://publications.waset.org/abstracts/search?q=malware%20family" title=" malware family"> malware family</a>, <a href="https://publications.waset.org/abstracts/search?q=malware%20labeling" title=" malware labeling"> malware labeling</a>, <a href="https://publications.waset.org/abstracts/search?q=AV%20labels" title=" AV labels"> AV labels</a> </p> <a href="https://publications.waset.org/abstracts/159376/a-genetic-algorithm-based-ensemble-method-with-pairwise-consensus-score-on-malware-cacophonous-labels" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159376.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">86</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">558</span> Utilize 5G Mobile Connection as a Node in the Proof of Authority Blockchain Used for Microtransaction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Frode%20van%20der%20Laak">Frode van der Laak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper contributes to the feasibility of using a 5G mobile connection as a node for a Proof of Authority (PoA) blockchain, which is used for microtransactions at the same time. It uses the phone number identity of the users that are linked to the crypto wallet address. It also proposed a consensus protocol based on Proof-of-Authority (PoA) blockchain; PoA is a permission blockchain where consensus is achieved through a set of designated authority rather than through mining, as is the case with a Proof of Work (PoW) blockchain. This report will first explain the concept of a PoA blockchain and how it works. It will then discuss the potential benefits and challenges of using a 5G mobile connection as a node in such a blockchain, and finally, the main open problem statement and proposed solutions with the requirements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=5G" title="5G">5G</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile" title=" mobile"> mobile</a>, <a href="https://publications.waset.org/abstracts/search?q=connection" title=" connection"> connection</a>, <a href="https://publications.waset.org/abstracts/search?q=node" title=" node"> node</a>, <a href="https://publications.waset.org/abstracts/search?q=PoA" title=" PoA"> PoA</a>, <a href="https://publications.waset.org/abstracts/search?q=blockchain" title=" blockchain"> blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=microtransaction" title=" microtransaction"> microtransaction</a> </p> <a href="https://publications.waset.org/abstracts/158556/utilize-5g-mobile-connection-as-a-node-in-the-proof-of-authority-blockchain-used-for-microtransaction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/158556.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">97</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">557</span> Citizens’ Readiness to Adopt and Use Electronic Voting System in Ghana</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Isaac%20Kofi%20Mensah">Isaac Kofi Mensah </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The adoption and application of Information and Communication Technologies (ICTs) in government administration through e-government is expected to permeate all sectors of state/ public institutions as well as democratic institutions. One of such public institutions is the Electoral Commission of Ghana mandated by the 1992 Constitution to hold all public elections including presidential and parliamentary elections. As Ghana holds its 7th General Elections since 1992, on 7th November 2016, there are demands from key stakeholders for the Election Management Body, which is the Electoral Commission (EC) of Ghana to adopt and implement an electronic voting system. This case study, therefore, attempts to contribute significantly to the debate by examining influencing factors that would impact on citizen’s readiness to adopt and use an electronic voting system in Ghana. The Technology Acceptance Model (TAM) was used as a theoretical framework for this study, out of which a research model and hypotheses were developed. Importantly, the outcome of this research finding would form a basis for appropriate policy recommendation for consideration of Government and EC of Ghana. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=citizens%20readiness" title="citizens readiness">citizens readiness</a>, <a href="https://publications.waset.org/abstracts/search?q=e-government" title=" e-government"> e-government</a>, <a href="https://publications.waset.org/abstracts/search?q=electronic%20voting" title=" electronic voting"> electronic voting</a>, <a href="https://publications.waset.org/abstracts/search?q=technology%20acceptance%20model%20%28TAM%29" title=" technology acceptance model (TAM)"> technology acceptance model (TAM)</a> </p> <a href="https://publications.waset.org/abstracts/46865/citizens-readiness-to-adopt-and-use-electronic-voting-system-in-ghana" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46865.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">266</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">556</span> Consensus-Oriented Analysis Model for Knowledge Management Failure Evaluation in Uncertain Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amir%20Ghasem%20Norouzi">Amir Ghasem Norouzi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahdi%20Zowghi"> Mahdi Zowghi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study propose a framework based on the fuzzy T-Norms, T-conorm, a novel operator, and multi-expert approach to help organizations build awareness of the critical influential factors on the success of knowledge management (KM) implementation, analysis the failure of knowledge management. This study considers the complex uncertainty concept that is in knowledge management implementing capability (KMIC) and it is used by fuzzy logic for this reason. The contribution of our paper is shown with an empirical study in a nonprofit educational organization evaluation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20logic" title="fuzzy logic">fuzzy logic</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20management" title=" knowledge management"> knowledge management</a>, <a href="https://publications.waset.org/abstracts/search?q=multi%20expert%20analysis" title=" multi expert analysis"> multi expert analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus%20oriented%20average%20operator" title=" consensus oriented average operator"> consensus oriented average operator</a> </p> <a href="https://publications.waset.org/abstracts/23075/consensus-oriented-analysis-model-for-knowledge-management-failure-evaluation-in-uncertain-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23075.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">627</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">555</span> Crack Width Evaluation for Flexural RC Members with Axial Tension</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sukrit%20Ghorai">Sukrit Ghorai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Proof of controlling crack width is a basic condition for securing suitable performance in serviceability limit state. The cracking in concrete can occur at any time from the casting of time to the years after the concrete has been set in place. Most codes struggle with offering procedure for crack width calculation. There is lack in availability of design charts for designers to compute crack width with ease. The focus of the study is to utilize design charts and parametric equations in calculating crack width with minimum error. The paper contains a simplified procedure to calculate crack width for reinforced concrete (RC) sections subjected to bending with axial tensile force following the guidelines of Euro code [DS EN-1992-1-1 & DS EN-1992-1-2]. Numerical examples demonstrate the application of the suggested procedure. Comparison with parallel analytical tools support the validity of result and show the percentage deviation of crack width in both the procedures. The technique is simple, user-friendly and ready to evolve for a greater spectrum of section sizes and materials. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=concrete%20structures" title="concrete structures">concrete structures</a>, <a href="https://publications.waset.org/abstracts/search?q=crack%20width%20calculation" title=" crack width calculation"> crack width calculation</a>, <a href="https://publications.waset.org/abstracts/search?q=serviceability%20limit%20state" title=" serviceability limit state"> serviceability limit state</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20design" title=" structural design"> structural design</a>, <a href="https://publications.waset.org/abstracts/search?q=bridge%20engineering" title=" bridge engineering"> bridge engineering</a> </p> <a href="https://publications.waset.org/abstracts/19413/crack-width-evaluation-for-flexural-rc-members-with-axial-tension" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19413.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">383</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">554</span> Rapid Strategic Consensus Building in Land Readjustment in Kabul</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nangialai%20Yousufzai">Nangialai Yousufzai</a>, <a href="https://publications.waset.org/abstracts/search?q=Eysosiyas%20Etana"> Eysosiyas Etana</a>, <a href="https://publications.waset.org/abstracts/search?q=Ikuo%20Sugiyama"> Ikuo Sugiyama</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Kabul population has been growing continually since 2001 and reaching six million in 2025 due to the rapid inflow from the neighboring countries. As a result of the population growth, lack of living facilities supported by infrastructure services is becoming serious in social and economic aspects. However, about 70% of the city is still occupied illegally and the government has little information on the infrastructure demands. To improve this situation, land readjustment is one of the powerful development tools, because land readjustment does not need a high governmental budget of itself. Instead, the method needs cooperation between stakeholders such as landowners, developers and a local government. So it is becoming crucial for both government and citizens to implement land readjustment for providing tidy urban areas with enough public services to realize more livable city as a whole. On the contrary, the traditional land readjustment tends to spend a long time until now to get consensus on the new plan between stakeholders. One of the reasons is that individual land area (land parcel) is decreased due to the contribution to public such as roads/parks/squares for improving the urban environment. The second reason is that the new plan is difficult for dwellers to imagine new life after the readjustment. Because the paper-based plan is made by an authority not for dwellers but for specialists to precede the project. This paper aims to shorten the time to realize quick consensus between stakeholders. The first improvement is utilizing questionnaire(s) to assess the demand and preference of the landowners. The second one is utilizing 3D model for dwellers to visualize the new environment easily after the readjustment. In additions, the 3D model is reflecting the demand and preference of the resident so that they could select a land parcel according to their sense value of life. The above-mentioned two improvements are carried out after evaluating total land prices of the new plans to select for maximizing the project value. The land price forecasting formula is derived from the current market ones in Kabul. Finally, it is stressed that the rapid consensus-building of land readjustment utilizing ICT and open data analysis is essential to redevelop slums and illegal occupied areas in Kabul. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=land%20readjustment" title="land readjustment">land readjustment</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus%20building" title=" consensus building"> consensus building</a>, <a href="https://publications.waset.org/abstracts/search?q=land%20price%20formula" title=" land price formula"> land price formula</a>, <a href="https://publications.waset.org/abstracts/search?q=3D%20simulation" title=" 3D simulation"> 3D simulation</a> </p> <a href="https://publications.waset.org/abstracts/51470/rapid-strategic-consensus-building-in-land-readjustment-in-kabul" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51470.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">332</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">‹</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=1992%20consensus&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=1992%20consensus&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=1992%20consensus&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=1992%20consensus&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=1992%20consensus&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=1992%20consensus&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=1992%20consensus&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=1992%20consensus&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=1992%20consensus&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=1992%20consensus&page=19">19</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=1992%20consensus&page=20">20</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=1992%20consensus&page=2" rel="next">›</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>