CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: merge sort</title> <meta name="description" content="Search results for: merge sort"> <meta name="keywords" content="merge sort"> <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="merge sort" 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="merge sort"> <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> 246</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: merge sort</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">246</span> Integrating Historical Narratives with Merge Games as Tools for Pedagogy In Education</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aathira%20H.">Aathira H.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Digital games can act as catalysts for educational transformation in the current scenario. Children and adolescence acquire this digital knowledge quickly and hence digital games can act as one of the most effective media for technology-mediated learning. Mobile gaming industries have seen the rise of a new trending genre of games, i.e., “Merge games” which is currently thriving in the market. This paper analysis on how gamifying historic and cultural narratives with merge mechanics can be an effective way to educate school children. Through the study of how merge mechanics in games have currently emerged as a trend., this paper argues how it can be integrated with a strong narrative which can convey history in an engaging way for education. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=game-based%20learning" title="game-based learning">game-based learning</a>, <a href="https://publications.waset.org/abstracts/search?q=merge%20mechanics" title=" merge mechanics"> merge mechanics</a>, <a href="https://publications.waset.org/abstracts/search?q=historical%20narratives" title=" historical narratives"> historical narratives</a>, <a href="https://publications.waset.org/abstracts/search?q=gaming%20innovations" title=" gaming innovations"> gaming innovations</a> </p> <a href="https://publications.waset.org/abstracts/177670/integrating-historical-narratives-with-merge-games-as-tools-for-pedagogy-in-education" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/177670.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">104</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">245</span> A Genetic Based Algorithm to Generate Random Simple Polygons Using a New Polygon Merge Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Nourollah">Ali Nourollah</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Movahedinejad"> Mohsen Movahedinejad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper a new algorithm to generate random simple polygons from a given set of points in a two dimensional plane is designed. The proposed algorithm uses a genetic algorithm to generate polygons with few vertices. A new merge algorithm is presented which converts any two polygons into a simple polygon. This algorithm at first changes two polygons into a polygonal chain and then the polygonal chain is converted into a simple polygon. The process of converting a polygonal chain into a simple polygon is based on the removal of intersecting edges. The merge algorithm has the time complexity of O ((r+s) *l) where r and s are the size of merging polygons and l shows the number of intersecting edges removed from the polygonal chain. It will be shown that 1 < l < r+s. The experiments results show that the proposed algorithm has the ability to generate a great number of different simple polygons and has better performance in comparison to celebrated algorithms such as space partitioning and steady growth. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Divide%20and%20conquer" title="Divide and conquer">Divide and conquer</a>, <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=merge%20polygons" title=" merge polygons"> merge polygons</a>, <a href="https://publications.waset.org/abstracts/search?q=Random%20simple%20polygon%20generation." title=" Random simple polygon generation. "> Random simple polygon generation. </a> </p> <a href="https://publications.waset.org/abstracts/21488/a-genetic-based-algorithm-to-generate-random-simple-polygons-using-a-new-polygon-merge-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21488.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">532</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">244</span> A Hybrid Traffic Model for Smoothing Traffic Near Merges</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shiri%20Elisheva%20Decktor">Shiri Elisheva Decktor</a>, <a href="https://publications.waset.org/abstracts/search?q=Sharon%20Hornstein"> Sharon Hornstein</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Highway merges and unmarked junctions are key components in any urban road network, which can act as bottlenecks and create traffic disruption. Inefficient highway merges may trigger traffic instabilities such as stop-and-go waves, pose safety conditions and lead to longer journey times. These phenomena occur spontaneously if the average vehicle density exceeds a certain critical value. This study focuses on modeling the traffic using a microscopic traffic flow model. A hybrid traffic model, which combines human-driven and controlled vehicles is assumed. The controlled vehicles obey different driving policies when approaching the merge, or in the vicinity of other vehicles. We developed a co-simulation model in SUMO (Simulation of Urban Mobility), in which the human-driven cars are modeled using the IDM model, and the controlled cars are modeled using a dedicated controller. The scenario chosen for this study is a closed track with one merge and one exit, which could be later implemented using a scaled infrastructure on our lab setup. This will enable us to benchmark the results of this study obtained in simulation, to comparable results in similar conditions in the lab. The metrics chosen for the comparison of the performance of our algorithm on the overall traffic conditions include the average speed, wait time near the merge, and throughput after the merge, measured under different travel demand conditions (low, medium, and heavy traffic). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=highway%20merges" title="highway merges">highway merges</a>, <a href="https://publications.waset.org/abstracts/search?q=traffic%20modeling" title="traffic modeling">traffic modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=SUMO" title=" SUMO"> SUMO</a>, <a href="https://publications.waset.org/abstracts/search?q=driving%20policy" title=" driving policy"> driving policy</a> </p> <a href="https://publications.waset.org/abstracts/154241/a-hybrid-traffic-model-for-smoothing-traffic-near-merges" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154241.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">106</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">243</span> Q-Test of Undergraduate Epistemology and Scientific Thought: Development and Testing of an Assessment of Scientific Epistemology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Matthew%20J.%20Zagumny">Matthew J. Zagumny</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The QUEST is an assessment of scientific epistemic beliefs and was developed to measure students’ intellectual development in regards to beliefs about knowledge and knowing. The QUEST utilizes Q-sort methodology, which requires participants to rate the degree to which statements describe them personally. As a measure of personal theories of knowledge, the QUEST instrument is described with the Q-sort distribution and scoring explained. A preliminary demonstration of the QUEST assessment is described with two samples of undergraduate students (novice/lower division compared to advanced/upper division students) being assessed and their average QUEST scores compared. The usefulness of an assessment of epistemology is discussed in terms of the principle that assessment tends to drive educational practice and university mission. The critical need for university and academic programs to focus on development of students’ scientific epistemology is briefly discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=scientific%20epistemology" title="scientific epistemology">scientific epistemology</a>, <a href="https://publications.waset.org/abstracts/search?q=critical%20thinking" title=" critical thinking"> critical thinking</a>, <a href="https://publications.waset.org/abstracts/search?q=Q-sort%20method" title=" Q-sort method"> Q-sort method</a>, <a href="https://publications.waset.org/abstracts/search?q=STEM%20undergraduates" title=" STEM undergraduates"> STEM undergraduates</a> </p> <a href="https://publications.waset.org/abstracts/45315/q-test-of-undergraduate-epistemology-and-scientific-thought-development-and-testing-of-an-assessment-of-scientific-epistemology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45315.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">378</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">242</span> Recursion, Merge and Event Sequence: A Bio-Mathematical Perspective </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Noury%20Bakrim">Noury Bakrim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Formalization is indeed a foundational Mathematical Linguistics as demonstrated by the pioneering works. While dialoguing with this frame, we nonetheless propone, in our approach of language as a real object, a mathematical linguistics/biosemiotics defined as a dialectical synthesis between induction and computational deduction. Therefore, relying on the parametric interaction of cycles, rules, and features giving way to a sub-hypothetic biological point of view, we first hypothesize a factorial equation as an explanatory principle within Category Mathematics of the Ergobrain: our computation proposal of Universal Grammar rules per cycle or a scalar determination (multiplying right/left columns of the determinant matrix and right/left columns of the logarithmic matrix) of the transformable matrix for rule addition/deletion and cycles within representational mapping/cycle heredity basing on the factorial example, being the logarithmic exponent or power of rule deletion/addition. It enables us to propone an extension of minimalist merge/label notions to a Language Merge (as a computing principle) within cycle recursion relying on combinatorial mapping of rules hierarchies on external Entax of the Event Sequence. Therefore, to define combinatorial maps as language merge of features and combinatorial hierarchical restrictions (governing, commanding, and other rules), we secondly hypothesize from our results feature/hierarchy exponentiation on graph representation deriving from Gromov's Symbolic Dynamics where combinatorial vertices from Fe are set to combinatorial vertices of Hie and edges from Fe to Hie such as for all combinatorial group, there are restriction maps representing different derivational levels that are subgraphs: the intersection on I defines pullbacks and deletion rules (under restriction maps) then under disjunction edges H such that for the combinatorial map P belonging to Hie exponentiation by intersection there are pullbacks and projections that are equal to restriction maps RM₁ and RM₂. The model will draw on experimental biomathematics as well as structural frames with focus on Amazigh and English (cases from phonology/micro-semantics, Syntax) shift from Structure to event (especially Amazigh formant principle resolving its morphological heterogeneity). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=rule%2Fcycle%20addition%2Fdeletion" title="rule/cycle addition/deletion">rule/cycle addition/deletion</a>, <a href="https://publications.waset.org/abstracts/search?q=bio-mathematical%20methodology" title=" bio-mathematical methodology"> bio-mathematical methodology</a>, <a href="https://publications.waset.org/abstracts/search?q=general%20merge%20calculation" title=" general merge calculation"> general merge calculation</a>, <a href="https://publications.waset.org/abstracts/search?q=feature%20exponentiation" title=" feature exponentiation"> feature exponentiation</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20maps" title=" combinatorial maps"> combinatorial maps</a>, <a href="https://publications.waset.org/abstracts/search?q=event%20sequence" title=" event sequence"> event sequence</a> </p> <a href="https://publications.waset.org/abstracts/131433/recursion-merge-and-event-sequence-a-bio-mathematical-perspective" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131433.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">127</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">241</span> A New Approach to Image Stitching of Radiographic Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Somaya%20Adwan">Somaya Adwan</a>, <a href="https://publications.waset.org/abstracts/search?q=Rasha%20Majed"> Rasha Majed</a>, <a href="https://publications.waset.org/abstracts/search?q=Lamya%27a%20Majed"> Lamya'a Majed</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamzah%20Arof"> Hamzah Arof</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to produce images with whole body parts, X-ray of different portions of the body parts is assembled using image stitching methods. A new method for image stitching that exploits mutually feature based method and direct based method to identify and merge pairs of X-ray medical images is presented in this paper. The performance of the proposed method based on this hybrid approach is investigated in this paper. The ability of the proposed method to stitch and merge the overlapping pairs of images is demonstrated. Our proposed method display comparable if not superior performance to other feature based methods that are mentioned in the literature on the standard databases. These results are promising and demonstrate the potential of the proposed method for further development to tackle more advanced stitching problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20stitching" title="image stitching">image stitching</a>, <a href="https://publications.waset.org/abstracts/search?q=direct%20based%20method" title=" direct based method"> direct based method</a>, <a href="https://publications.waset.org/abstracts/search?q=panoramic%20image" title=" panoramic image"> panoramic image</a>, <a href="https://publications.waset.org/abstracts/search?q=X-ray" title=" X-ray"> X-ray</a> </p> <a href="https://publications.waset.org/abstracts/17610/a-new-approach-to-image-stitching-of-radiographic-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17610.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">541</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">240</span> Software Evolution Based Activity Diagrams</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zine-Eddine%20Bouras">Zine-Eddine Bouras</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelouaheb%20Talai"> Abdelouaheb Talai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> During the last two decades, the software evolution community has intensively tackled the software merging issue whose main objective is to merge in a consistent way different versions of software in order to obtain a new version. Well-established approaches, mainly based on the dependence analysis techniques, have been used to bring suitable solutions. These approaches concern the source code or software architectures. However, these solutions are more expensive due to the complexity and size. In this paper, we overcome this problem by operating at a high level of abstraction. The objective of this paper is to investigate the software merging at the level of UML activity diagrams, which is a new interesting issue. Its purpose is to merge activity diagrams instead of source code. The proposed approach, based on dependence analysis techniques, is illustrated through an appropriate case study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=activity%20diagram" title="activity diagram">activity diagram</a>, <a href="https://publications.waset.org/abstracts/search?q=activity%20diagram%20slicing" title=" activity diagram slicing"> activity diagram slicing</a>, <a href="https://publications.waset.org/abstracts/search?q=dependency%20analysis" title=" dependency analysis"> dependency analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20merging" title=" software merging"> software merging</a> </p> <a href="https://publications.waset.org/abstracts/42420/software-evolution-based-activity-diagrams" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42420.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">327</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">239</span> Identifying Critical Success Factors for Data Quality Management through a Delphi Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maria%20Paula%20Santos">Maria Paula Santos</a>, <a href="https://publications.waset.org/abstracts/search?q=Ana%20Lucas"> Ana Lucas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Organizations support their operations and decision making on the data they have at their disposal, so the quality of these data is remarkably important and Data Quality (DQ) is currently a relevant issue, the literature being unanimous in pointing out that poor DQ can result in large costs for organizations. The literature review identified and described 24 Critical Success Factors (CSF) for Data Quality Management (DQM) that were presented to a panel of experts, who ordered them according to their degree of importance, using the Delphi method with the Q-sort technique, based on an online questionnaire. The study shows that the five most important CSF for DQM are: definition of appropriate policies and standards, control of inputs, definition of a strategic plan for DQ, organizational culture focused on quality of the data and obtaining top management commitment and support. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=critical%20success%20factors" title="critical success factors">critical success factors</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20quality" title=" data quality"> data quality</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20quality%20management" title=" data quality management"> data quality management</a>, <a href="https://publications.waset.org/abstracts/search?q=Delphi" title=" Delphi"> Delphi</a>, <a href="https://publications.waset.org/abstracts/search?q=Q-Sort" title=" Q-Sort"> Q-Sort</a> </p> <a href="https://publications.waset.org/abstracts/107548/identifying-critical-success-factors-for-data-quality-management-through-a-delphi-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/107548.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">217</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">238</span> The Social Perception of National Security Risks: A Comparative Perspective</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nicula%20Valentin">Nicula Valentin</a>, <a href="https://publications.waset.org/abstracts/search?q=Andrei%20Virginia"> Andrei Virginia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, the individual plays a central role in the state’s architecture. This is why the subjective dimension of the security represents a key concept in risk assessment. The paper’s scope is to emphasize the discrepancy between expert and lay evaluations of national security hazards, which is caused by key factors like emotions, personal experience, knowledge and media. Therefore, we have chosen to apply, using these two different groups of respondents, the Q-sort method, which reveals individual beliefs, attitudes, preferences hidden behind the subjects’ own way of prioritizing the risks they are confronted with. Our study’s conclusions are meant to unveil significant indicators needed to be taken into consideration by a state’s leadership in order to understand the social perception of national security hazards, to communicate better with the public opinion and prevent or mitigate the overestimation of the severity or probability of these dangers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=risk%20perception" title="risk perception">risk perception</a>, <a href="https://publications.waset.org/abstracts/search?q=Q-sort%20method" title=" Q-sort method"> Q-sort method</a>, <a href="https://publications.waset.org/abstracts/search?q=national%20security%20hazards" title=" national security hazards"> national security hazards</a>, <a href="https://publications.waset.org/abstracts/search?q=individual%20beliefs" title=" individual beliefs"> individual beliefs</a> </p> <a href="https://publications.waset.org/abstracts/29340/the-social-perception-of-national-security-risks-a-comparative-perspective" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29340.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">309</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">237</span> Analysis of the Simulation Merger and Economic Benefit of Local Farmers' Associations in Taiwan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lu%20Yung-Hsiang">Lu Yung-Hsiang</a>, <a href="https://publications.waset.org/abstracts/search?q=Chang%20Kuming"> Chang Kuming</a>, <a href="https://publications.waset.org/abstracts/search?q=Dai%20Yi-Fang"> Dai Yi-Fang</a>, <a href="https://publications.waset.org/abstracts/search?q=Liao%20Ching-Yi"> Liao Ching-Yi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> According to Taiwan’s administrative division of future land planning may lead farmer association and service areas facing recombination or merger. Thus, merger combination and the economic benefit of the farmer association are worth to be discussed. The farmer association in the merger, which may cause some then will not be consolidated, or consolidate two, or ever more to one association. However, under what condition to merge is greatest, as one of observation of this study. In addition, research without using simulation methods and only on the credit department rather whole farmer association. Therefore, this paper will use the simulation approach, and examine both the merge of farmer association and the condition under which the benefits are the greatest. The data of this study set include 266 farmer associations in Taiwan period 2012 to 2013. Empirical results showed that the number of the farmer association optimal simulation combination is 108.After the merger from the first stage can be reduced by 60% of the farmers’ association. The cost saving effects of the post-merger is not different. The cost efficiency of the farmers’ association improved it. The economies of scale and scope would decrease by the merger. The research paper hopes the finding will benefit the future merger of the farmers’ association. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=simulation%20merger" title="simulation merger">simulation merger</a>, <a href="https://publications.waset.org/abstracts/search?q=farmer%20association" title=" farmer association"> farmer association</a>, <a href="https://publications.waset.org/abstracts/search?q=assurance%20region" title=" assurance region"> assurance region</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20envelopment%20analysis" title=" data envelopment analysis"> data envelopment analysis</a> </p> <a href="https://publications.waset.org/abstracts/42991/analysis-of-the-simulation-merger-and-economic-benefit-of-local-farmers-associations-in-taiwan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42991.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">350</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">236</span> An Improved Ant Colony Algorithm for Genome Rearrangements</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Essam%20Al%20Daoud">Essam Al Daoud</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genome rearrangement is an important area in computational biology and bioinformatics. The basic problem in genome rearrangements is to compute the edit distance, i.e., the minimum number of operations needed to transform one genome into another. Unfortunately, unsigned genome rearrangement problem is NP-hard. In this study an improved ant colony optimization algorithm to approximate the edit distance is proposed. The main idea is to convert the unsigned permutation to signed permutation and evaluate the ants by using Kaplan algorithm. Two new operations are added to the standard ant colony algorithm: Replacing the worst ants by re-sampling the ants from a new probability distribution and applying the crossover operations on the best ants. The proposed algorithm is tested and compared with the improved breakpoint reversal sort algorithm by using three datasets. The results indicate that the proposed algorithm achieves better accuracy ratio than the previous methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20algorithm" title="ant colony algorithm">ant colony algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=edit%20distance" title=" edit distance"> edit distance</a>, <a href="https://publications.waset.org/abstracts/search?q=genome%0D%0Abreakpoint" title=" genome breakpoint"> genome breakpoint</a>, <a href="https://publications.waset.org/abstracts/search?q=genome%20rearrangement" title=" genome rearrangement"> genome rearrangement</a>, <a href="https://publications.waset.org/abstracts/search?q=reversal%20sort" title=" reversal sort"> reversal sort</a> </p> <a href="https://publications.waset.org/abstracts/5601/an-improved-ant-colony-algorithm-for-genome-rearrangements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5601.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">344</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">235</span> Reducing CO2 Emission Using EDA and Weighted Sum Model in Smart Parking System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rahman%20Ali">Rahman Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Sajjad"> Muhammad Sajjad</a>, <a href="https://publications.waset.org/abstracts/search?q=Farkhund%20Iqbal"> Farkhund Iqbal</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Sadiq%20Hassan%20Zada"> Muhammad Sadiq Hassan Zada</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Hussain"> Mohammed Hussain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Emission of Carbon Dioxide (CO<sub>2</sub>) has adversely affected the environment. One of the major sources of CO<sub>2 </sub>emission is transportation. In the last few decades, the increase in mobility of people using vehicles has enormously increased the emission of CO<sub>2</sub> in the environment. To reduce CO<sub>2</sub> emission, sustainable transportation system is required in which smart parking is one of the important measures that need to be established. To contribute to the issue of reducing the amount of CO<sub>2 </sub>emission, this research proposes a smart parking system. A cloud-based solution is provided to the drivers which automatically searches and recommends the most preferred parking slots. To determine preferences of the parking areas, this methodology exploits a number of unique parking features which ultimately results in the selection of a parking that leads to minimum level of CO<sub>2 </sub>emission from the current position of the vehicle. To realize the methodology, a scenario-based implementation is considered. During the implementation, a mobile application with GPS signals, vehicles with a number of vehicle features and a list of parking areas with parking features are used by sorting, multi-level filtering, exploratory data analysis (EDA, Analytical Hierarchy Process (AHP)) and weighted sum model (WSM) to rank the parking areas and recommend the drivers with top-k most preferred parking areas. In the EDA process, “2020testcar-2020-03-03”, a freely available dataset is used to estimate CO<sub>2 </sub>emission of a particular vehicle. To evaluate the system, results of the proposed system are compared with the conventional approach, which reveal that the proposed methodology supersedes the conventional one in reducing the emission of CO<sub>2 </sub>into the atmosphere. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=car%20parking" title="car parking">car parking</a>, <a href="https://publications.waset.org/abstracts/search?q=Co2" title=" Co2"> Co2</a>, <a href="https://publications.waset.org/abstracts/search?q=Co2%20reduction" title=" Co2 reduction"> Co2 reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=IoT" title=" IoT"> IoT</a>, <a href="https://publications.waset.org/abstracts/search?q=merge%20sort" title=" merge sort"> merge sort</a>, <a href="https://publications.waset.org/abstracts/search?q=number%20plate%20recognition" title=" number plate recognition"> number plate recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20car%20parking" title=" smart car parking"> smart car parking</a> </p> <a href="https://publications.waset.org/abstracts/128420/reducing-co2-emission-using-eda-and-weighted-sum-model-in-smart-parking-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128420.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">146</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">234</span> Analysis on the Development and Evolution of China’s Territorial Spatial Planning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=He%20YuanYan">He YuanYan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, China has implemented the reform of land and space planning. As an important public policy, land and space planning plays a vital role in the construction and development of cities. Land and space planning throughout the country is in full swing, but there are still many disputes from all walks of life. The content, scope, and specific implementation process of land and space planning are also ambiguous, leading to the integration of multiple regulation problems such as unclear authority, unclear responsibilities, and poor planning results during the implementation of land and space planning. Therefore, it is necessary to sort out the development and evolution of domestic and foreign land space planning, clarify the problems and cruxes from the current situation of China's land space planning, and sort out the obstacles and countermeasures to the implementation of this policy, so as to deepen the understanding of the connotation of land space planning. It is of great practical significance for all planners to correctly understand and clarify the specific contents and methods of land space planning and to smoothly promote the implementation of land space planning at all levels. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=territorial%20spatial%20planning" title="territorial spatial planning">territorial spatial planning</a>, <a href="https://publications.waset.org/abstracts/search?q=public%20policy" title=" public policy"> public policy</a>, <a href="https://publications.waset.org/abstracts/search?q=land%20space" title=" land space"> land space</a>, <a href="https://publications.waset.org/abstracts/search?q=overall%20planning" title=" overall planning"> overall planning</a> </p> <a href="https://publications.waset.org/abstracts/159371/analysis-on-the-development-and-evolution-of-chinas-territorial-spatial-planning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159371.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">131</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">233</span> Algorithm Optimization to Sort in Parallel by Decreasing the Number of the Processors in SIMD (Single Instruction Multiple Data) Systems </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Hosseini">Ali Hosseini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Paralleling is a mechanism to decrease the time necessary to execute the programs. Sorting is one of the important operations to be used in different systems in a way that the proper function of many algorithms and operations depend on sorted data. CRCW_SORT algorithm executes ‘N’ elements sorting in O(1) time on SIMD (Single Instruction Multiple Data) computers with n^2/2-n/2 number of processors. In this article having presented a mechanism by dividing the input string by the hinge element into two less strings the number of the processors to be used in sorting ‘N’ elements in O(1) time has decreased to n^2/8-n/4 in the best state; by this mechanism the best state is when the hinge element is the middle one and the worst state is when it is minimum. The findings from assessing the proposed algorithm by other methods on data collection and number of the processors indicate that the proposed algorithm uses less processors to sort during execution than other methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CRCW" title="CRCW">CRCW</a>, <a href="https://publications.waset.org/abstracts/search?q=SIMD%20%28Single%20Instruction%20Multiple%20Data%29%0D%0Acomputers" title=" SIMD (Single Instruction Multiple Data) computers"> SIMD (Single Instruction Multiple Data) computers</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computers" title=" parallel computers"> parallel computers</a>, <a href="https://publications.waset.org/abstracts/search?q=number%20of%20the%0D%0Aprocessors" title=" number of the processors"> number of the processors</a> </p> <a href="https://publications.waset.org/abstracts/29094/algorithm-optimization-to-sort-in-parallel-by-decreasing-the-number-of-the-processors-in-simd-single-instruction-multiple-data-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29094.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">310</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">232</span> Coronavirus Academic Paper Sorting Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Christina%20A.%20van%20Hal">Christina A. van Hal</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaoqian%20Jiang"> Xiaoqian Jiang</a>, <a href="https://publications.waset.org/abstracts/search?q=Luyao%20Chen"> Luyao Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Yan%20Chu"> Yan Chu</a>, <a href="https://publications.waset.org/abstracts/search?q=Robert%20D.%20Jolly"> Robert D. Jolly</a>, <a href="https://publications.waset.org/abstracts/search?q=Yaobin%20Lin"> Yaobin Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Jitian%20Zhao"> Jitian Zhao</a>, <a href="https://publications.waset.org/abstracts/search?q=Kang%20Lin%20Hsieh"> Kang Lin Hsieh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The COVID-19 Literature Summary App was created for the primary purpose of enabling academicians and clinicians to quickly sort through the vast array of recent coronavirus publications by topics of interest. Multiple methods of summarizing and sorting the manuscripts were created. A summary page introduces the application function and capabilities, while an interactive map provides daily updates on infection, death, and recovery rates. A page with a pivot table allows publication sorting by topic, with an interactive data table that allows sorting topics by columns, as wells as the capability to view abstracts. Additionally, publications may be sorted by the medical topics they cover. We used the CORD-19 database to compile lists of publications. The data table can sort binary variables, allowing the user to pick desired publication topics, such as papers that describe COVID-19 symptoms. The application is primarily designed for use by researchers but can be used by anybody who wants a faster and more efficient means of locating papers of interest. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=COVID-19" title="COVID-19">COVID-19</a>, <a href="https://publications.waset.org/abstracts/search?q=literature%20summary" title=" literature summary"> literature summary</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20retrieval" title=" information retrieval"> information retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=Snorkel" title=" Snorkel"> Snorkel</a> </p> <a href="https://publications.waset.org/abstracts/134327/coronavirus-academic-paper-sorting-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/134327.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">152</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">231</span> Movement of the Viscous Elastic Fixed Vertically Located Cylinder in Liquid with the Free Surface Under the Influence of Waves</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20J.%20Hasanova">T. J. Hasanova</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20N.%20Imamalieva"> C. N. Imamalieva </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problem about the movement of the rigid cylinder keeping the vertical position under the influence of running superficial waves in a liquid is considered. The indignation of a falling wave caused by the presence of the cylinder which moves is thus considered. Special decomposition on a falling harmonious wave is used. The problem dares an operational method. For a finding of the original decision, Considering that the image denominator represents a tabular function, Voltaire's integrated equation of the first sort which dares a numerical method is used. Cylinder movement in the continuous environment under the influence of waves is considered in work. Problems are solved by an operational method, thus originals of required functions are looked for by the numerical definition of poles of combinations of transcendental functions and calculation of not own integrals. Using specificity of a task below, Decisions are under construction the numerical solution of the integrated equation of Volter of the first sort that does not create computing problems of the complex roots of transcendental functions connected with search. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=rigid%20cylinder" title="rigid cylinder">rigid cylinder</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20interpolation" title=" linear interpolation"> linear interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=fluctuations" title=" fluctuations"> fluctuations</a>, <a href="https://publications.waset.org/abstracts/search?q=Voltaire%27s%20integrated%20equation" title=" Voltaire's integrated equation"> Voltaire's integrated equation</a>, <a href="https://publications.waset.org/abstracts/search?q=harmonious%20wave" title=" harmonious wave"> harmonious wave</a> </p> <a href="https://publications.waset.org/abstracts/3183/movement-of-the-viscous-elastic-fixed-vertically-located-cylinder-in-liquid-with-the-free-surface-under-the-influence-of-waves" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3183.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">319</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">230</span> Context Detection in Spreadsheets Based on Automatically Inferred Table Schema</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alexander%20Wachtel">Alexander Wachtel</a>, <a href="https://publications.waset.org/abstracts/search?q=Michael%20T.%20Franzen"> Michael T. Franzen</a>, <a href="https://publications.waset.org/abstracts/search?q=Walter%20F.%20Tichy"> Walter F. Tichy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Programming requires years of training. With natural language and end user development methods, programming could become available to everyone. It enables end users to program their own devices and extend the functionality of the existing system without any knowledge of programming languages. In this paper, we describe an Interactive Spreadsheet Processing Module (ISPM), a natural language interface to spreadsheets that allows users to address ranges within the spreadsheet based on inferred table schema. Using the ISPM, end users are able to search for values in the schema of the table and to address the data in spreadsheets implicitly. Furthermore, it enables them to select and sort the spreadsheet data by using natural language. ISPM uses a machine learning technique to automatically infer areas within a spreadsheet, including different kinds of headers and data ranges. Since ranges can be identified from natural language queries, the end users can query the data using natural language. During the evaluation 12 undergraduate students were asked to perform operations (sum, sort, group and select) using the system and also Excel without ISPM interface, and the time taken for task completion was compared across the two systems. Only for the selection task did users take less time in Excel (since they directly selected the cells using the mouse) than in ISPM, by using natural language for end user software engineering, to overcome the present bottleneck of professional developers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=natural%20language%20processing" title="natural language processing">natural language processing</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20language%20interfaces" title=" natural language interfaces"> natural language interfaces</a>, <a href="https://publications.waset.org/abstracts/search?q=human%20computer%20interaction" title=" human computer interaction"> human computer interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=end%20user%20development" title=" end user development"> end user development</a>, <a href="https://publications.waset.org/abstracts/search?q=dialog%20systems" title=" dialog systems"> dialog systems</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20recognition" title=" data recognition"> data recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=spreadsheet" title=" spreadsheet"> spreadsheet</a> </p> <a href="https://publications.waset.org/abstracts/54528/context-detection-in-spreadsheets-based-on-automatically-inferred-table-schema" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54528.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">311</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">229</span> DWT-SATS Based Detection of Image Region Cloning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michael%20Zimba">Michael Zimba</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A duplicated image region may be subjected to a number of attacks such as noise addition, compression, reflection, rotation, and scaling with the intention of either merely mating it to its targeted neighborhood or preventing its detection. In this paper, we present an effective and robust method of detecting duplicated regions inclusive of those affected by the various attacks. In order to reduce the dimension of the image, the proposed algorithm firstly performs discrete wavelet transform, DWT, of a suspicious image. However, unlike most existing copy move image forgery (CMIF) detection algorithms operating in the DWT domain which extract only the low frequency sub-band of the DWT of the suspicious image thereby leaving valuable information in the other three sub-bands, the proposed algorithm simultaneously extracts features from all the four sub-bands. The extracted features are not only more accurate representation of image regions but also robust to additive noise, JPEG compression, and affine transformation. Furthermore, principal component analysis-eigenvalue decomposition, PCA-EVD, is applied to reduce the dimension of the features. The extracted features are then sorted using the more computationally efficient Radix Sort algorithm. Finally, same affine transformation selection, SATS, a duplication verification method, is applied to detect duplicated regions. The proposed algorithm is not only fast but also more robust to attacks compared to the related CMIF detection algorithms. The experimental results show high detection rates. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=affine%20transformation" title="affine transformation">affine transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20wavelet%20transform" title=" discrete wavelet transform"> discrete wavelet transform</a>, <a href="https://publications.waset.org/abstracts/search?q=radix%20sort" title=" radix sort"> radix sort</a>, <a href="https://publications.waset.org/abstracts/search?q=SATS" title=" SATS"> SATS</a> </p> <a href="https://publications.waset.org/abstracts/4432/dwt-sats-based-detection-of-image-region-cloning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4432.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">230</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">228</span> Heterogeneous-Resolution and Multi-Source Terrain Builder for CesiumJS WebGL Virtual Globe</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Umberto%20Di%20Staso">Umberto Di Staso</a>, <a href="https://publications.waset.org/abstracts/search?q=Marco%20Soave"> Marco Soave</a>, <a href="https://publications.waset.org/abstracts/search?q=Alessio%20Giori"> Alessio Giori</a>, <a href="https://publications.waset.org/abstracts/search?q=Federico%20Prandi"> Federico Prandi</a>, <a href="https://publications.waset.org/abstracts/search?q=Raffaele%20De%20Amicis"> Raffaele De Amicis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The increasing availability of information about earth surface elevation (Digital Elevation Models DEM) generated from different sources (remote sensing, Aerial Images, Lidar) poses the question about how to integrate and make available to the most than possible audience this huge amount of data. In order to exploit the potential of 3D elevation representation the quality of data management plays a fundamental role. Due to the high acquisition costs and the huge amount of generated data, highresolution terrain surveys tend to be small or medium sized and available on limited portion of earth. Here comes the need to merge large-scale height maps that typically are made available for free at worldwide level, with very specific high resolute datasets. One the other hand, the third dimension increases the user experience and the data representation quality, unlocking new possibilities in data analysis for civil protection, real estate, urban planning, environment monitoring, etc. The open-source 3D virtual globes, which are trending topics in Geovisual Analytics, aim at improving the visualization of geographical data provided by standard web services or with proprietary formats. Typically, 3D Virtual globes like do not offer an open-source tool that allows the generation of a terrain elevation data structure starting from heterogeneous-resolution terrain datasets. This paper describes a technological solution aimed to set up a so-called “Terrain Builder”. This tool is able to merge heterogeneous-resolution datasets, and to provide a multi-resolution worldwide terrain services fully compatible with CesiumJS and therefore accessible via web using traditional browser without any additional plug-in. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Terrain%20Builder" title="Terrain Builder">Terrain Builder</a>, <a href="https://publications.waset.org/abstracts/search?q=WebGL" title=" WebGL"> WebGL</a>, <a href="https://publications.waset.org/abstracts/search?q=Virtual%20Globe" title=" Virtual Globe"> Virtual Globe</a>, <a href="https://publications.waset.org/abstracts/search?q=CesiumJS" title=" CesiumJS"> CesiumJS</a>, <a href="https://publications.waset.org/abstracts/search?q=Tiled%20Map%20Service" title=" Tiled Map Service"> Tiled Map Service</a>, <a href="https://publications.waset.org/abstracts/search?q=TMS" title=" TMS"> TMS</a>, <a href="https://publications.waset.org/abstracts/search?q=Height-Map" title=" Height-Map"> Height-Map</a>, <a href="https://publications.waset.org/abstracts/search?q=Regular%20Grid" title=" Regular Grid"> Regular Grid</a>, <a href="https://publications.waset.org/abstracts/search?q=Geovisual%20Analytics" title=" Geovisual Analytics"> Geovisual Analytics</a>, <a href="https://publications.waset.org/abstracts/search?q=DTM" title=" DTM"> DTM</a> </p> <a href="https://publications.waset.org/abstracts/35472/heterogeneous-resolution-and-multi-source-terrain-builder-for-cesiumjs-webgl-virtual-globe" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35472.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">425</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">227</span> Merging of Results in Distributed Information Retrieval Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Larbi%20Guezouli">Larbi Guezouli</a>, <a href="https://publications.waset.org/abstracts/search?q=Imane%20Azzouz"> Imane Azzouz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work is located in the domain of distributed information retrieval ‘DIR’. A simplified view of the DIR requires a multi-search in a set of collections, which forces the system to analyze results found in these collections, and merge results back before sending them to the user in a single list. Our work is to find a fusion method based on the relevance score of each result received from collections and the relevance of the local search engine of each collection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20retrieval" title="information retrieval">information retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20IR%20systems" title=" distributed IR systems"> distributed IR systems</a>, <a href="https://publications.waset.org/abstracts/search?q=merging%20results" title=" merging results"> merging results</a>, <a href="https://publications.waset.org/abstracts/search?q=datamining" title=" datamining"> datamining</a> </p> <a href="https://publications.waset.org/abstracts/37130/merging-of-results-in-distributed-information-retrieval-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37130.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">336</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">226</span> Proposition of an Ontology of Diseases and Their Signs from Medical Ontologies Integration</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adama%20Sow">Adama Sow</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdoulaye%20Guiss%C2%B4e"> Abdoulaye Guiss´e</a>, <a href="https://publications.waset.org/abstracts/search?q=Oumar%20Niang"> Oumar Niang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To assist medical diagnosis, we propose a federation of several existing and open medical ontologies and terminologies. The goal is to merge the strengths of all these resources to provide clinicians the access to a variety of shared knowledges that can facilitate identification and association of human diseases and all of their available characteristic signs such as symptoms and clinical signs. This work results to an integration model loaded from target known ontologies of the bioportal platform such as DOID, MESH, and SNOMED for diseases selection, SYMP, and CSSO for all existing signs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=medical%20decision" title="medical decision">medical decision</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20ontologies" title=" medical ontologies"> medical ontologies</a>, <a href="https://publications.waset.org/abstracts/search?q=ontologies%20integration" title=" ontologies integration"> ontologies integration</a>, <a href="https://publications.waset.org/abstracts/search?q=linked%20data" title=" linked data"> linked data</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20engineering" title=" knowledge engineering"> knowledge engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=e-health%20system" title=" e-health system"> e-health system</a> </p> <a href="https://publications.waset.org/abstracts/93508/proposition-of-an-ontology-of-diseases-and-their-signs-from-medical-ontologies-integration" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93508.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">197</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">225</span> Community Structure Detection in Networks Based on Bee Colony</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bilal%20Saoud">Bilal Saoud</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a new method to find the community structure in networks. Our method is based on bee colony and the maximization of modularity to find the community structure. We use a bee colony algorithm to find the first community structure that has a good value of modularity. To improve the community structure, that was found, we merge communities until we get a community structure that has a high value of modularity. We provide a general framework for implementing our approach. We tested our method on computer-generated and real-world networks with a comparison to very known community detection methods. The obtained results show the effectiveness of our proposition. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bee%20colony" title="bee colony">bee colony</a>, <a href="https://publications.waset.org/abstracts/search?q=networks" title=" networks"> networks</a>, <a href="https://publications.waset.org/abstracts/search?q=modularity" title=" modularity"> modularity</a>, <a href="https://publications.waset.org/abstracts/search?q=normalized%20mutual%20information" title=" normalized mutual information"> normalized mutual information</a> </p> <a href="https://publications.waset.org/abstracts/93455/community-structure-detection-in-networks-based-on-bee-colony" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93455.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">406</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">224</span> Construction of Finite Woven Frames through Bounded Linear Operators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Bhandari">A. Bhandari</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Mukherjee"> S. Mukherjee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Two frames in a Hilbert space are called woven or weaving if all possible merge combinations between them generate frames of the Hilbert space with uniform frame bounds. Weaving frames are powerful tools in wireless sensor networks which require distributed data processing. Considering the practical applications, this article deals with finite woven frames. We provide methods of constructing finite woven frames, in particular, bounded linear operators are used to construct woven frames from a given frame. Several examples are discussed. We also introduce the notion of woven frame sequences and characterize them through the concepts of gaps and angles between spaces. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frames" title="frames">frames</a>, <a href="https://publications.waset.org/abstracts/search?q=woven%20frames" title=" woven frames"> woven frames</a>, <a href="https://publications.waset.org/abstracts/search?q=gap" title=" gap"> gap</a>, <a href="https://publications.waset.org/abstracts/search?q=angle" title=" angle"> angle</a> </p> <a href="https://publications.waset.org/abstracts/100698/construction-of-finite-woven-frames-through-bounded-linear-operators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/100698.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">193</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">223</span> New Ways of Vocabulary Enlargement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Pesina">S. Pesina</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Solonchak"> T. Solonchak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Lexical invariants, being a sort of stereotypes within the frames of ordinary consciousness, are created by the members of a language community as a result of uniform division of reality. The invariant meaning is formed in person’s mind gradually in the course of different actualizations of secondary meanings in various contexts. We understand lexical the invariant as abstract language essence containing a set of semantic components. In one of its configurations it is the basis or all or a number of the meanings making up the semantic structure of the word. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=lexical%20invariant" title="lexical invariant">lexical invariant</a>, <a href="https://publications.waset.org/abstracts/search?q=invariant%20theories" title=" invariant theories"> invariant theories</a>, <a href="https://publications.waset.org/abstracts/search?q=polysemantic%20word" title=" polysemantic word"> polysemantic word</a>, <a href="https://publications.waset.org/abstracts/search?q=cognitive%20linguistics" title=" cognitive linguistics"> cognitive linguistics</a> </p> <a href="https://publications.waset.org/abstracts/10620/new-ways-of-vocabulary-enlargement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10620.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">322</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">222</span> Epidemiology and Jeopardy Aspect of Febrile Neutropenia Patients by Means of Infectious Maladies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pouya%20Karimi">Pouya Karimi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramin%20Ghasemi%20Shayan"> Ramin Ghasemi Shayan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conclusions of the sort and setting of observational treatment for immunocompromised patients with fever are confused by the qualities of the hidden disease and the impacts of medications previously got, just as by changing microbiological examples and patterns in sedate obstruction at national and institutional levels. A few frameworks have been proposed to recognize patients who could profit by outpatient anti-infection treatment from patients who require hospitalization. Useful contemplations may choose whether the fundamental checking during the time of neutropenia can be accomplished. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=microbiology" title="microbiology">microbiology</a>, <a href="https://publications.waset.org/abstracts/search?q=infectious" title=" infectious"> infectious</a>, <a href="https://publications.waset.org/abstracts/search?q=neutropenia" title=" neutropenia"> neutropenia</a>, <a href="https://publications.waset.org/abstracts/search?q=epidemiology" title=" epidemiology "> epidemiology </a> </p> <a href="https://publications.waset.org/abstracts/123368/epidemiology-and-jeopardy-aspect-of-febrile-neutropenia-patients-by-means-of-infectious-maladies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/123368.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">162</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">221</span> Grain Boundary Detection Based on Superpixel Merges</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gaokai%20Liu">Gaokai Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The distribution of material grain sizes reflects the strength, fracture, corrosion and other properties, and the grain size can be acquired via the grain boundary. In recent years, the automatic grain boundary detection is widely required instead of complex experimental operations. In this paper, an effective solution is applied to acquire the grain boundary of material images. First, the initial superpixel segmentation result is obtained via a superpixel approach. Then, a region merging method is employed to merge adjacent regions based on certain similarity criterions, the experimental results show that the merging strategy improves the superpixel segmentation result on material datasets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=grain%20boundary%20detection" title="grain boundary detection">grain boundary detection</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20segmentation" title=" image segmentation"> image segmentation</a>, <a href="https://publications.waset.org/abstracts/search?q=material%20images" title=" material images"> material images</a>, <a href="https://publications.waset.org/abstracts/search?q=region%20merging" title=" region merging"> region merging</a> </p> <a href="https://publications.waset.org/abstracts/133188/grain-boundary-detection-based-on-superpixel-merges" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133188.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">169</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">220</span> Altered States of Consciousness in Narrative Cinema: Subjective Film Sound</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mladen%20Milicevic">Mladen Milicevic </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, subjective film sound will be addressed as it gets represented in narrative cinema. First, 'meta-diegetic' sound will be briefly explained followed by transition to “oneiric” sound. The representation of oneiric sound refers to a situation where film characters are experiencing some sort of an altered state of consciousness. Looking at an antlered state of consciousness in terms of human brain processes will point out to the cinematic ways of expression, which 'mimic' those processes. Using several examples for different films will illustrate these points. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=oneiric" title="oneiric">oneiric</a>, <a href="https://publications.waset.org/abstracts/search?q=ASC" title=" ASC"> ASC</a>, <a href="https://publications.waset.org/abstracts/search?q=film" title=" film"> film</a>, <a href="https://publications.waset.org/abstracts/search?q=sound" title=" sound "> sound </a> </p> <a href="https://publications.waset.org/abstracts/2901/altered-states-of-consciousness-in-narrative-cinema-subjective-film-sound" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2901.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">374</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">219</span> The Operating Behaviour of Unbalanced Unpaced Merging Assembly Lines</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Shaaban">S. Shaaban</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20McNamara"> T. McNamara</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Hudson"> S. Hudson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper reports on the performance of deliberately unbalanced, reliable, non-automated and assembly lines that merge, whose workstations differ in terms of their mean operation times. Simulations are carried out on 5- and 8-station lines with 1, 2 and 4 buffer capacity units, % degrees of line imbalance of 2, 5 and 12, and 24 different patterns of means imbalance. Data on two performance measures, namely throughput and average buffer level were gathered, statistically analysed and compared to a merging balanced line counterpart. It was found that the best configurations are a balanced line arrangement and a monotone decreasing order for each of the parallel merging lines, with the first generally resulting in a lower throughput and the second leading to a lower average buffer level than those of a balanced line. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=average%20buffer%20level" title="average buffer level">average buffer level</a>, <a href="https://publications.waset.org/abstracts/search?q=merging%20lines" title=" merging lines"> merging lines</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=throughput" title=" throughput"> throughput</a>, <a href="https://publications.waset.org/abstracts/search?q=unbalanced" title=" unbalanced"> unbalanced</a> </p> <a href="https://publications.waset.org/abstracts/42374/the-operating-behaviour-of-unbalanced-unpaced-merging-assembly-lines" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42374.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">321</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">218</span> Iraqi Media Entrepreneurs across Social Media: Factors and Challenges</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Omar%20Bali">Ahmed Omar Bali</a>, <a href="https://publications.waset.org/abstracts/search?q=Sherko%20%20Jabar"> Sherko Jabar</a>, <a href="https://publications.waset.org/abstracts/search?q=Hazhar%20Jalal"> Hazhar Jalal</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahdi%20Sofi-Karim"> Mahdi Sofi-Karim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For a long while in Iraq, media organizations were owned by political parties, particularly the ruling parties, because media traditional organizations required big capital and human resources. This paper has examined the dynamics of Iraqi media market transformation with emphasizing on factors that help to merge media entrepreneurs and digital media firms which target audience on social media. A qualitative method was adopted in this study using open, in-depth interviews with 19 media entrepreneurs and three managers of media firms. The study revealed that relative freedom and advanced communication technologies have encouraged media entrepreneurs to drive the new media on producing short videos and broadcast them on social media which has become popular among media consumers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=media%20entrepreneur" title="media entrepreneur">media entrepreneur</a>, <a href="https://publications.waset.org/abstracts/search?q=Iraq" title=" Iraq"> Iraq</a>, <a href="https://publications.waset.org/abstracts/search?q=journalists" title=" journalists"> journalists</a>, <a href="https://publications.waset.org/abstracts/search?q=media%20technicians" title=" media technicians"> media technicians</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20media%20firms" title=" digital media firms"> digital media firms</a>, <a href="https://publications.waset.org/abstracts/search?q=media%20market" title=" media market"> media market</a> </p> <a href="https://publications.waset.org/abstracts/119420/iraqi-media-entrepreneurs-across-social-media-factors-and-challenges" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/119420.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">305</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">217</span> Placement Characteristics of Major Stream Vehicular Traffic at Median Openings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tathagatha%20Khan">Tathagatha Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Smruti%20Sourava%20Mohapatra"> Smruti Sourava Mohapatra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Median openings are provided in raised median of multilane roads to facilitate U-turn movement. The U-turn movement is a highly complex and risky maneuver because U-turning vehicle (minor stream) makes 180° turns at median openings and merge with the approaching through traffic (major stream). A U-turning vehicle requires a suitable gap in the major stream to merge, and during this process, the possibility of merging conflict develops. Therefore, these median openings are potential hot spot of conflict and posses concern pertaining to safety. The traffic at the median openings could be managed efficiently with enhanced safety when the capacity of a traffic facility has been estimated correctly. The capacity of U-turns at median openings is estimated by Harder’s formula, which requires three basic parameters namely critical gap, follow up time and conflict flow rate. The estimation of conflicting flow rate under mixed traffic condition is very much complicated due to absence of lane discipline and discourteous behavior of the drivers. The understanding of placement of major stream vehicles at median opening is very much important for the estimation of conflicting traffic faced by U-turning movement. The placement data of major stream vehicles at different section in 4-lane and 6-lane divided multilane roads were collected. All the test sections were free from the effect of intersection, bus stop, parked vehicles, curvature, pedestrian movements or any other side friction. For the purpose of analysis, all the vehicles were divided into 6 categories such as motorized 2W, autorickshaw (3-W), small car, big car, light commercial vehicle, and heavy vehicle. For the collection of placement data of major stream vehicles, the entire road width was divided into sections of 25 cm each and these were numbered seriatim from the pavement edge (curbside) to the end of the road. The placement major stream vehicle crossing the reference line was recorded by video graphic technique on various weekdays. The collected data for individual category of vehicles at all the test sections were converted into a frequency table with a class interval of 25 cm each and the placement frequency curve. Separate distribution fittings were tried for 4- lane and 6-lane divided roads. The variation of major stream traffic volume on the placement characteristics of major stream vehicles has also been explored. The findings of this study will be helpful to determine the conflict volume at the median openings. So, the present work holds significance in traffic planning, operation and design to alleviate the bottleneck, prospect of collision and delay at median opening in general and at median opening in developing countries in particular. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=median%20opening" title="median opening">median opening</a>, <a href="https://publications.waset.org/abstracts/search?q=U-turn" title=" U-turn"> U-turn</a>, <a href="https://publications.waset.org/abstracts/search?q=conflicting%20traffic" title=" conflicting traffic"> conflicting traffic</a>, <a href="https://publications.waset.org/abstracts/search?q=placement" title=" placement"> placement</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20traffic" title=" mixed traffic"> mixed traffic</a> </p> <a href="https://publications.waset.org/abstracts/103673/placement-characteristics-of-major-stream-vehicular-traffic-at-median-openings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103673.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> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=merge%20sort&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=merge%20sort&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=merge%20sort&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=merge%20sort&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=merge%20sort&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=merge%20sort&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=merge%20sort&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=merge%20sort&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=merge%20sort&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>