CINXE.COM

<!DOCTYPE html> <html lang="en" xmlns:fb="http://www.facebook.com/2008/fbml" class="wf-loading"> <head prefix="og: https://ogp.me/ns# fb: https://ogp.me/ns/fb# academia: https://ogp.me/ns/fb/academia#"> <meta charset="utf-8"> <meta name=viewport content="width=device-width, initial-scale=1"> <meta rel="search" type="application/opensearchdescription+xml" href="/open_search.xml" title="Academia.edu"> <title>Sorting Research Papers - Academia.edu</title>  <link href="//a.academia-assets.com/images/favicons/favicon-production.ico" rel="shortcut icon" type="image/vnd.microsoft.icon"> <link rel="apple-touch-icon" sizes="57x57" href="//a.academia-assets.com/images/favicons/apple-touch-icon-57x57.png"> <link rel="apple-touch-icon" sizes="60x60" href="//a.academia-assets.com/images/favicons/apple-touch-icon-60x60.png"> <link rel="apple-touch-icon" sizes="72x72" href="//a.academia-assets.com/images/favicons/apple-touch-icon-72x72.png"> <link rel="apple-touch-icon" sizes="76x76" href="//a.academia-assets.com/images/favicons/apple-touch-icon-76x76.png"> <link rel="apple-touch-icon" sizes="114x114" href="//a.academia-assets.com/images/favicons/apple-touch-icon-114x114.png"> <link rel="apple-touch-icon" sizes="120x120" href="//a.academia-assets.com/images/favicons/apple-touch-icon-120x120.png"> <link rel="apple-touch-icon" sizes="144x144" href="//a.academia-assets.com/images/favicons/apple-touch-icon-144x144.png"> <link rel="apple-touch-icon" sizes="152x152" href="//a.academia-assets.com/images/favicons/apple-touch-icon-152x152.png"> <link rel="apple-touch-icon" sizes="180x180" href="//a.academia-assets.com/images/favicons/apple-touch-icon-180x180.png"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-32x32.png" sizes="32x32"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-194x194.png" sizes="194x194"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-96x96.png" sizes="96x96"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/android-chrome-192x192.png" sizes="192x192"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-16x16.png" sizes="16x16"> <link rel="manifest" href="//a.academia-assets.com/images/favicons/manifest.json"> <meta name="msapplication-TileColor" content="#2b5797"> <meta name="msapplication-TileImage" content="//a.academia-assets.com/images/favicons/mstile-144x144.png"> <meta name="theme-color" content="#ffffff"> <script> window.performance && window.performance.measure && window.performance.measure("Time To First Byte", "requestStart", "responseStart"); </script> <script> (function() { if (!window.URLSearchParams || !window.history || !window.history.replaceState) { return; } var searchParams = new URLSearchParams(window.location.search); var paramsToDelete = [ 'fs', 'sm', 'swp', 'iid', 'nbs', 'rcc', // related content category 'rcpos', // related content carousel position 'rcpg', // related carousel page 'rchid', // related content hit id 'f_ri', // research interest id, for SEO tracking 'f_fri', // featured research interest, for SEO tracking (param key without value) 'f_rid', // from research interest directory for SEO tracking 'f_loswp', // from research interest pills on LOSWP sidebar for SEO tracking 'rhid', // referrring hit id ]; if (paramsToDelete.every((key) => searchParams.get(key) === null)) { return; } paramsToDelete.forEach((key) => { searchParams.delete(key); }); var cleanUrl = new URL(window.location.href); cleanUrl.search = searchParams.toString(); history.replaceState({}, document.title, cleanUrl); })(); </script> <script async src="https://www.googletagmanager.com/gtag/js?id=G-5VKX33P2DS"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-5VKX33P2DS', { cookie_domain: 'academia.edu', send_page_view: false, }); gtag('event', 'page_view', { 'controller': "by_tag", 'action': "show_one", 'controller_action': 'by_tag#show_one', 'logged_in': 'false', 'edge': 'unknown', // Send nil if there is no A/B test bucket, in case some records get logged // with missing data - that way we can distinguish between the two cases. // ab_test_bucket should be of the form <ab_test_name>:<bucket> 'ab_test_bucket': null, }) </script> <script type="text/javascript"> window.sendUserTiming = function(timingName) { if (!(window.performance && window.performance.measure)) return; var entries = window.performance.getEntriesByName(timingName, "measure"); if (entries.length !== 1) return; var timingValue = Math.round(entries[0].duration); gtag('event', 'timing_complete', { name: timingName, value: timingValue, event_category: 'User-centric', }); }; window.sendUserTiming("Time To First Byte"); </script> <meta name="csrf-param" content="authenticity_token" /> <meta name="csrf-token" content="iQR0ST4yfxZbqQoOTTL5wB+bjOmFfiCwZioe1/Kwm+R4pqt3MTvd15WeK9O/BV7PLvVIZTYV8OxVW+FiSe+HhA==" /> <link href="/Documents/in/Sorting?after=50%2C29991443" rel="next" /><link crossorigin="" href="https://fonts.gstatic.com/" rel="preconnect" /><link href="https://fonts.googleapis.com/css2?family=DM+Sans:ital,opsz,wght@0,9..40,100..1000;1,9..40,100..1000&family=Gupter:wght@400;500;700&family=IBM+Plex+Mono:wght@300;400&family=Material+Symbols+Outlined:opsz,wght,FILL,GRAD@20,400,0,0&display=swap" rel="stylesheet" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/common-10fa40af19d25203774df2d4a03b9b5771b45109c2304968038e88a81d1215c5.css" /> <meta name="description" content="View Sorting Research Papers on Academia.edu for free." /> <meta name="google-site-verification" content="bKJMBZA7E43xhDOopFZkssMMkBRjvYERV-NaN4R6mrs" /> <script> var $controller_name = 'by_tag'; var $action_name = "show_one"; var $rails_env = 'production'; var $app_rev = '92477ec68c09d28ae4730a4143c926f074776319'; var $domain = 'academia.edu'; var $app_host = "academia.edu"; var $asset_host = "academia-assets.com"; var $start_time = new Date().getTime(); var $recaptcha_key = "6LdxlRMTAAAAADnu_zyLhLg0YF9uACwz78shpjJB"; var $recaptcha_invisible_key = "6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj"; var $disableClientRecordHit = false; </script> <script> window.Aedu = { hit_data: null }; window.Aedu.SiteStats = {"premium_universities_count":15276,"monthly_visitors":"113 million","monthly_visitor_count":113458213,"monthly_visitor_count_in_millions":113,"user_count":277547635,"paper_count":55203019,"paper_count_in_millions":55,"page_count":432000000,"page_count_in_millions":432,"pdf_count":16500000,"pdf_count_in_millions":16}; window.Aedu.serverRenderTime = new Date(1732811987000); window.Aedu.timeDifference = new Date().getTime() - 1732811987000; window.Aedu.isUsingCssV1 = false; window.Aedu.enableLocalization = true; window.Aedu.activateFullstory = false; window.Aedu.serviceAvailability = { status: {"attention_db":"on","bibliography_db":"on","contacts_db":"on","email_db":"on","indexability_db":"on","mentions_db":"on","news_db":"on","notifications_db":"on","offsite_mentions_db":"on","redshift":"on","redshift_exports_db":"on","related_works_db":"on","ring_db":"on","user_tests_db":"on"}, serviceEnabled: function(service) { return this.status[service] === "on"; }, readEnabled: function(service) { return this.serviceEnabled(service) || this.status[service] === "read_only"; }, }; window.Aedu.viewApmTrace = function() { // Check if x-apm-trace-id meta tag is set, and open the trace in APM // in a new window if it is. var apmTraceId = document.head.querySelector('meta[name="x-apm-trace-id"]'); if (apmTraceId) { var traceId = apmTraceId.content; // Use trace ID to construct URL, an example URL looks like: // https://app.datadoghq.com/apm/traces?query=trace_id%31298410148923562634 var apmUrl = 'https://app.datadoghq.com/apm/traces?query=trace_id%3A' + traceId; window.open(apmUrl, '_blank'); } }; </script>  <link href="https://fonts.googleapis.com/css?family=Roboto:100,100i,300,300i,400,400i,500,500i,700,700i,900,900i" rel="stylesheet"> <link href="//maxcdn.bootstrapcdn.com/font-awesome/4.3.0/css/font-awesome.min.css" rel="stylesheet"> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/libraries-a9675dcb01ec4ef6aa807ba772c7a5a00c1820d3ff661c1038a20f80d06bb4e4.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/academia-bdb9e8c097f01e611f2fc5e2f1a9dc599beede975e2ae5629983543a1726e947.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system_legacy-056a9113b9a0f5343d013b29ee1929d5a18be35fdcdceb616600b4db8bd20054.css" /> <script src="//a.academia-assets.com/assets/webpack_bundles/runtime-bundle-005434038af4252ca37c527588411a3d6a0eabb5f727fac83f8bbe7fd88d93bb.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/webpack_libraries_and_infrequently_changed.wjs-bundle-bae13f9b51961d5f1e06008e39e31d0138cb31332e8c2e874c6d6a250ec2bb14.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/core_webpack.wjs-bundle-19a25d160d01bde427443d06cd6b810c4c92c6026e7cb31519e06313eb24ed90.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/sentry.wjs-bundle-5fe03fddca915c8ba0f7edbe64c194308e8ce5abaed7bffe1255ff37549c4808.js"></script> <script> jade = window.jade || {}; jade.helpers = window.$h; jade._ = window._; </script>  <script id="tag-manager-head-root">(function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= 'https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer_old','GTM-5G9JF7Z');</script>  <script> window.gptadslots = []; window.googletag = window.googletag || {}; window.googletag.cmd = window.googletag.cmd || []; </script> <script type="text/javascript"> // TODO(jacob): This should be defined, may be rare load order problem. // Checking if null is just a quick fix, will default to en if unset. // Better fix is to run this immedietely after I18n is set. if (window.I18n != null) { I18n.defaultLocale = "en"; I18n.locale = "en"; I18n.fallbacks = true; } </script> <link rel="canonical" href="https://www.academia.edu/Documents/in/Sorting" /> </head>   <body class='c-by_tag a-show_one logged_out u-bgColorWhite'>  <div id="fb-root"></div><script>window.fbAsyncInit = function() { FB.init({ appId: "2369844204", version: "v8.0", status: true, cookie: true, xfbml: true }); // Additional initialization code. if (window.InitFacebook) { // facebook.ts already loaded, set it up. window.InitFacebook(); } else { // Set a flag for facebook.ts to find when it loads. window.academiaAuthReadyFacebook = true; } };</script><script>window.fbAsyncLoad = function() { // Protection against double calling of this function if (window.FB) { return; } (function(d, s, id){ var js, fjs = d.getElementsByTagName(s)[0]; if (d.getElementById(id)) {return;} js = d.createElement(s); js.id = id; js.src = "//connect.facebook.net/en_US/sdk.js"; fjs.parentNode.insertBefore(js, fjs); }(document, 'script', 'facebook-jssdk')); } if (!window.defer_facebook) { // Autoload if not deferred window.fbAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.fbAsyncLoad(); }, 5000); }</script> <div id="google-root"></div><script>window.loadGoogle = function() { if (window.InitGoogle) { // google.ts already loaded, set it up. window.InitGoogle("331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"); } else { // Set a flag for google.ts to use when it loads. window.GoogleClientID = "331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"; } };</script><script>window.googleAsyncLoad = function() { // Protection against double calling of this function (function(d) { var js; var id = 'google-jssdk'; var ref = d.getElementsByTagName('script')[0]; if (d.getElementById(id)) { return; } js = d.createElement('script'); js.id = id; js.async = true; js.onload = loadGoogle; js.src = "https://accounts.google.com/gsi/client" ref.parentNode.insertBefore(js, ref); }(document)); } if (!window.defer_google) { // Autoload if not deferred window.googleAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.googleAsyncLoad(); }, 5000); }</script> <div id="tag-manager-body-root">  <noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5G9JF7Z" height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript>   <script> window.addEventListener('load', function() { if (document.querySelector('input[name="commit"]')) { document.querySelector('input[name="commit"]').addEventListener('click', function() { gtag('event', 'click', { event_category: 'button', event_label: 'Log In' }) }) } }); </script> </div> <script>var _comscore = _comscore || []; _comscore.push({ c1: "2", c2: "26766707" }); (function() { var s = document.createElement("script"), el = document.getElementsByTagName("script")[0]; s.async = true; s.src = (document.location.protocol == "https:" ? "https://sb" : "http://b") + ".scorecardresearch.com/beacon.js"; el.parentNode.insertBefore(s, el); })();</script><img src="https://sb.scorecardresearch.com/p?c1=2&c2=26766707&cv=2.0&cj=1" style="position: absolute; visibility: hidden" /> <div id='react-modal'></div> <div class='DesignSystem'> <a class='u-showOnFocus' href='#site'> Skip to main content </a> </div> <div id="upgrade_ie_banner" style="display: none;"><p>Academia.edu no longer supports Internet Explorer.</p><p>To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to <a href="https://www.academia.edu/upgrade-browser">upgrade your browser</a>.</p></div><script>// Show this banner for all versions of IE if (!!window.MSInputMethodContext || /(MSIE)/.test(navigator.userAgent)) { document.getElementById('upgrade_ie_banner').style.display = 'block'; }</script> <div class="DesignSystem bootstrap ShrinkableNav no-sm no-md"><div class="navbar navbar-default main-header"><div class="container-wrapper" id="main-header-container"><div class="container"><div class="navbar-header"><div class="nav-left-wrapper u-mt0x"><div class="nav-logo"><a data-main-header-link-target="logo_home" href="https://www.academia.edu/"><img class="visible-xs-inline-block" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015-A.svg" width="24" height="24" /><img width="145.2" height="18" class="hidden-xs" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015.svg" /></a></div><div class="nav-search"><div class="SiteSearch-wrapper select2-no-default-pills"><form class="js-SiteSearch-form DesignSystem" action="https://www.academia.edu/search" accept-charset="UTF-8" method="get"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><i class="SiteSearch-icon fa fa-search u-fw700 u-positionAbsolute u-tcGrayDark"></i><input class="js-SiteSearch-form-input SiteSearch-form-input form-control" data-main-header-click-target="search_input" name="q" placeholder="Search" type="text" value="" /></form></div></div></div><div class="nav-right-wrapper pull-right"><ul class="NavLinks js-main-nav list-unstyled"><li class="NavLinks-link"><a class="js-header-login-url Button Button--inverseGray Button--sm u-mb4x" id="nav_log_in" rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="NavLinks-link u-p0x"><a class="Button Button--inverseGray Button--sm u-mb4x" rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li></ul><button class="hidden-lg hidden-md hidden-sm u-ml4x navbar-toggle collapsed" data-target=".js-mobile-header-links" data-toggle="collapse" type="button"><span class="icon-bar"></span><span class="icon-bar"></span><span class="icon-bar"></span></button></div></div><div class="collapse navbar-collapse js-mobile-header-links"><ul class="nav navbar-nav"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li><li class="u-borderColorGrayLight u-borderBottom1 js-mobile-nav-expand-trigger"><a href="#">more&nbsp<span class="caret"></span></a></li><li><ul class="js-mobile-nav-expand-section nav navbar-nav u-m0x collapse"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/about">About</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/press">Press</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://medium.com/@academia">Blog</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/documents">Papers</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/hiring"><i class="fa fa-briefcase"></i> We're Hiring!</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://support.academia.edu/"><i class="fa fa-question-circle"></i> Help Center</a></li><li class="js-mobile-nav-collapse-trigger u-borderColorGrayLight u-borderBottom1 dropup" style="display:none"><a href="#">less&nbsp<span class="caret"></span></a></li></ul></li></ul></div></div></div><script>(function(){ var $moreLink = $(".js-mobile-nav-expand-trigger"); var $lessLink = $(".js-mobile-nav-collapse-trigger"); var $section = $('.js-mobile-nav-expand-section'); $moreLink.click(function(ev){ ev.preventDefault(); $moreLink.hide(); $lessLink.show(); $section.collapse('show'); }); $lessLink.click(function(ev){ ev.preventDefault(); $moreLink.show(); $lessLink.hide(); $section.collapse('hide'); }); })() if ($a.is_logged_in() || false) { new Aedu.NavigationController({ el: '.js-main-nav', showHighlightedNotification: false }); } else { $(".js-header-login-url").attr("href", $a.loginUrlWithRedirect()); } Aedu.autocompleteSearch = new AutocompleteSearch({el: '.js-SiteSearch-form'});</script></div></div> <div id='site' class='fixed'> <div id="content" class="clearfix"> <script>document.addEventListener('DOMContentLoaded', function(){ var $dismissible = $(".dismissible_banner"); $dismissible.click(function(ev) { $dismissible.hide(); }); });</script> <div class="DesignSystem" style="margin-top:-40px"><div class="PageHeader"><div class="container"><div class="row"><style type="text/css">.sor-abstract { display: -webkit-box; overflow: hidden; text-overflow: ellipsis; -webkit-line-clamp: 3; -webkit-box-orient: vertical; }</style><div class="col-xs-12 clearfix"><div class="u-floatLeft"><h1 class="PageHeader-title u-m0x u-fs30">Sorting</h1><div class="u-tcGrayDark">2,266 Followers</div><div class="u-tcGrayDark u-mt2x">Recent papers in <b>Sorting</b></div></div></div></div></div></div><div class="TabbedNavigation"><div class="container"><div class="row"><div class="col-xs-12 clearfix"><ul class="nav u-m0x u-p0x list-inline u-displayFlex"><li class="active"><a href="https://www.academia.edu/Documents/in/Sorting">Top Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Sorting/MostCited">Most Cited Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Sorting/MostDownloaded">Most Downloaded Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Sorting/MostRecent">Newest Papers</a></li><li><a class="" href="https://www.academia.edu/People/Sorting">People</a></li></ul></div><style type="text/css">ul.nav{flex-direction:row}@media(max-width: 567px){ul.nav{flex-direction:column}.TabbedNavigation li{max-width:100%}.TabbedNavigation li.active{background-color:var(--background-grey, #dddde2)}.TabbedNavigation li.active:before,.TabbedNavigation li.active:after{display:none}}</style></div></div></div><div class="container"><div class="row"><div class="col-xs-12"><div class="u-displayFlex"><div class="u-flexGrow1"><div class="works"><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_77922623" data-work_id="77922623" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/77922623/A_VLSI_sorting_image_sensor_global_massively_parallel_intensity_to_time_processing_for_low_latency_adaptive_vision">A VLSI sorting image sensor: global massively parallel intensity-to-time processing for low-latency adaptive vision</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/77922623" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c4b272df3d8a7b3e598fd6b302c0d00e" rel="nofollow" data-download="{"attachment_id":85148522,"asset_id":77922623,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/85148522/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="147589778" href="https://independent.academia.edu/VladimirBrajovic">Vladimir Brajovic</a><script data-card-contents-for-user="147589778" type="text/json">{"id":147589778,"first_name":"Vladimir","last_name":"Brajovic","domain_name":"independent","page_name":"VladimirBrajovic","display_name":"Vladimir Brajovic","profile_url":"https://independent.academia.edu/VladimirBrajovic?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_77922623 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="77922623"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 77922623, container: ".js-paper-rank-work_77922623", }); });</script></li><li class="js-percentile-work_77922623 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 77922623; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_77922623"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_77922623 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="77922623"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 77922623; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=77922623]").text(description); $(".js-view-count-work_77922623").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_77922623").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="77922623"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">20</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="60" href="https://www.academia.edu/Documents/in/Mechanical_Engineering">Mechanical Engineering</a>, <script data-card-contents-for-ri="60" type="text/json">{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="9832" href="https://www.academia.edu/Documents/in/VLSI">VLSI</a>, <script data-card-contents-for-ri="9832" type="text/json">{"id":9832,"name":"VLSI","url":"https://www.academia.edu/Documents/in/VLSI?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="26870" href="https://www.academia.edu/Documents/in/Image_segmentation">Image segmentation</a><script data-card-contents-for-ri="26870" type="text/json">{"id":26870,"name":"Image segmentation","url":"https://www.academia.edu/Documents/in/Image_segmentation?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=77922623]'), work: {"id":77922623,"title":"A VLSI sorting image sensor: global massively parallel intensity-to-time processing for low-latency adaptive vision","created_at":"2022-04-28T23:08:48.991-07:00","url":"https://www.academia.edu/77922623/A_VLSI_sorting_image_sensor_global_massively_parallel_intensity_to_time_processing_for_low_latency_adaptive_vision?f_ri=223634","dom_id":"work_77922623","summary":null,"downloadable_attachments":[{"id":85148522,"asset_id":77922623,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":147589778,"first_name":"Vladimir","last_name":"Brajovic","domain_name":"independent","page_name":"VladimirBrajovic","display_name":"Vladimir Brajovic","profile_url":"https://independent.academia.edu/VladimirBrajovic?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=223634","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false},{"id":9832,"name":"VLSI","url":"https://www.academia.edu/Documents/in/VLSI?f_ri=223634","nofollow":false},{"id":26870,"name":"Image segmentation","url":"https://www.academia.edu/Documents/in/Image_segmentation?f_ri=223634","nofollow":false},{"id":33386,"name":"Sensor Arrays","url":"https://www.academia.edu/Documents/in/Sensor_Arrays?f_ri=223634"},{"id":36006,"name":"Adaptive Signal Processing","url":"https://www.academia.edu/Documents/in/Adaptive_Signal_Processing?f_ri=223634"},{"id":89067,"name":"Very Large Scale Integration","url":"https://www.academia.edu/Documents/in/Very_Large_Scale_Integration?f_ri=223634"},{"id":96825,"name":"Manufacturing Engineering","url":"https://www.academia.edu/Documents/in/Manufacturing_Engineering?f_ri=223634"},{"id":123206,"name":"Optical computing","url":"https://www.academia.edu/Documents/in/Optical_computing?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":322954,"name":"Chip","url":"https://www.academia.edu/Documents/in/Chip?f_ri=223634"},{"id":340088,"name":"Prototypes","url":"https://www.academia.edu/Documents/in/Prototypes?f_ri=223634"},{"id":644548,"name":"Low Latency","url":"https://www.academia.edu/Documents/in/Low_Latency?f_ri=223634"},{"id":786355,"name":"Image Sensor","url":"https://www.academia.edu/Documents/in/Image_Sensor?f_ri=223634"},{"id":904693,"name":"Top Down","url":"https://www.academia.edu/Documents/in/Top_Down?f_ri=223634"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=223634"},{"id":1381061,"name":"Image Sensors","url":"https://www.academia.edu/Documents/in/Image_Sensors?f_ri=223634"},{"id":1707689,"name":"Pixel","url":"https://www.academia.edu/Documents/in/Pixel?f_ri=223634"},{"id":1789210,"name":"Histograms","url":"https://www.academia.edu/Documents/in/Histograms?f_ri=223634"},{"id":1993786,"name":"Cumulant","url":"https://www.academia.edu/Documents/in/Cumulant?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_75898182" data-work_id="75898182" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/75898182/Clio_grows_up_from_research_prototype_to_industrial_tool">Clio grows up: from research prototype to industrial tool</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/75898182" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="40b47723a708f81ca8a8133c611eb84e" rel="nofollow" data-download="{"attachment_id":83562502,"asset_id":75898182,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/83562502/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="51744440" href="https://independent.academia.edu/MauricioHernandez119">Mauricio Hernandez</a><script data-card-contents-for-user="51744440" type="text/json">{"id":51744440,"first_name":"Mauricio","last_name":"Hernandez","domain_name":"independent","page_name":"MauricioHernandez119","display_name":"Mauricio Hernandez","profile_url":"https://independent.academia.edu/MauricioHernandez119?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_75898182 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="75898182"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 75898182, container: ".js-paper-rank-work_75898182", }); });</script></li><li class="js-percentile-work_75898182 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 75898182; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_75898182"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_75898182 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="75898182"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 75898182; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=75898182]").text(description); $(".js-view-count-work_75898182").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_75898182").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="75898182"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="49339" href="https://www.academia.edu/Documents/in/Data_Streams">Data Streams</a>, <script data-card-contents-for-ri="49339" type="text/json">{"id":49339,"name":"Data Streams","url":"https://www.academia.edu/Documents/in/Data_Streams?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="161591" href="https://www.academia.edu/Documents/in/Graph_Representation">Graph Representation</a>, <script data-card-contents-for-ri="161591" type="text/json">{"id":161591,"name":"Graph Representation","url":"https://www.academia.edu/Documents/in/Graph_Representation?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a><script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=75898182]'), work: {"id":75898182,"title":"Clio grows up: from research prototype to industrial tool","created_at":"2022-04-09T04:11:24.189-07:00","url":"https://www.academia.edu/75898182/Clio_grows_up_from_research_prototype_to_industrial_tool?f_ri=223634","dom_id":"work_75898182","summary":null,"downloadable_attachments":[{"id":83562502,"asset_id":75898182,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":51744440,"first_name":"Mauricio","last_name":"Hernandez","domain_name":"independent","page_name":"MauricioHernandez119","display_name":"Mauricio Hernandez","profile_url":"https://independent.academia.edu/MauricioHernandez119?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false},{"id":49339,"name":"Data Streams","url":"https://www.academia.edu/Documents/in/Data_Streams?f_ri=223634","nofollow":false},{"id":161591,"name":"Graph Representation","url":"https://www.academia.edu/Documents/in/Graph_Representation?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false},{"id":247459,"name":"Schema Mapping","url":"https://www.academia.edu/Documents/in/Schema_Mapping?f_ri=223634"},{"id":339262,"name":"Lessons Learned","url":"https://www.academia.edu/Documents/in/Lessons_Learned?f_ri=223634"},{"id":651477,"name":"Structured Query Language","url":"https://www.academia.edu/Documents/in/Structured_Query_Language?f_ri=223634"},{"id":1034284,"name":"Frequencies","url":"https://www.academia.edu/Documents/in/Frequencies?f_ri=223634"},{"id":2534771,"name":"Quantiles","url":"https://www.academia.edu/Documents/in/Quantiles?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_28845552" data-work_id="28845552" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/28845552/A_Survey_of_Public_Attitudes_To_Recycling_in_Glasgow_U_K_">A Survey of Public Attitudes To Recycling in Glasgow (U.K.)</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/28845552" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f7bed24feceb720182b31e3841959e08" rel="nofollow" data-download="{"attachment_id":49265950,"asset_id":28845552,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49265950/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="54302351" href="https://strathclyde.academia.edu/ValerieBelton">Valerie Belton</a><script data-card-contents-for-user="54302351" type="text/json">{"id":54302351,"first_name":"Valerie","last_name":"Belton","domain_name":"strathclyde","page_name":"ValerieBelton","display_name":"Valerie Belton","profile_url":"https://strathclyde.academia.edu/ValerieBelton?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_28845552 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="28845552"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 28845552, container: ".js-paper-rank-work_28845552", }); });</script></li><li class="js-percentile-work_28845552 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 28845552; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_28845552"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_28845552 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="28845552"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 28845552; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=28845552]").text(description); $(".js-view-count-work_28845552").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_28845552").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="28845552"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="55" href="https://www.academia.edu/Documents/in/Environmental_Engineering">Environmental Engineering</a>, <script data-card-contents-for-ri="55" type="text/json">{"id":55,"name":"Environmental Engineering","url":"https://www.academia.edu/Documents/in/Environmental_Engineering?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="73" href="https://www.academia.edu/Documents/in/Civil_Engineering">Civil Engineering</a>, <script data-card-contents-for-ri="73" type="text/json">{"id":73,"name":"Civil Engineering","url":"https://www.academia.edu/Documents/in/Civil_Engineering?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5645" href="https://www.academia.edu/Documents/in/Recycling">Recycling</a>, <script data-card-contents-for-ri="5645" type="text/json">{"id":5645,"name":"Recycling","url":"https://www.academia.edu/Documents/in/Recycling?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="14085" href="https://www.academia.edu/Documents/in/Waste_Management">Waste Management</a><script data-card-contents-for-ri="14085" type="text/json">{"id":14085,"name":"Waste Management","url":"https://www.academia.edu/Documents/in/Waste_Management?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=28845552]'), work: {"id":28845552,"title":"A Survey of Public Attitudes To Recycling in Glasgow (U.K.)","created_at":"2016-10-01T06:15:46.842-07:00","url":"https://www.academia.edu/28845552/A_Survey_of_Public_Attitudes_To_Recycling_in_Glasgow_U_K_?f_ri=223634","dom_id":"work_28845552","summary":null,"downloadable_attachments":[{"id":49265950,"asset_id":28845552,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":54302351,"first_name":"Valerie","last_name":"Belton","domain_name":"strathclyde","page_name":"ValerieBelton","display_name":"Valerie Belton","profile_url":"https://strathclyde.academia.edu/ValerieBelton?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":55,"name":"Environmental Engineering","url":"https://www.academia.edu/Documents/in/Environmental_Engineering?f_ri=223634","nofollow":false},{"id":73,"name":"Civil Engineering","url":"https://www.academia.edu/Documents/in/Civil_Engineering?f_ri=223634","nofollow":false},{"id":5645,"name":"Recycling","url":"https://www.academia.edu/Documents/in/Recycling?f_ri=223634","nofollow":false},{"id":14085,"name":"Waste Management","url":"https://www.academia.edu/Documents/in/Waste_Management?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":266585,"name":"Social Survey","url":"https://www.academia.edu/Documents/in/Social_Survey?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_31245739" data-work_id="31245739" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/31245739/Parallel_triangular_mesh_decimation_without_sorting">Parallel triangular mesh decimation without sorting</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/31245739" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f25a73aeda697f4d6c27023ae7dc807a" rel="nofollow" data-download="{"attachment_id":51652410,"asset_id":31245739,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/51652410/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="59686925" href="https://zcu.academia.edu/VaclavSkala">Vaclav Skala</a><script data-card-contents-for-user="59686925" type="text/json">{"id":59686925,"first_name":"Vaclav","last_name":"Skala","domain_name":"zcu","page_name":"VaclavSkala","display_name":"Vaclav Skala","profile_url":"https://zcu.academia.edu/VaclavSkala?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_31245739 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="31245739"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 31245739, container: ".js-paper-rank-work_31245739", }); });</script></li><li class="js-percentile-work_31245739 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 31245739; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_31245739"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_31245739 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="31245739"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 31245739; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=31245739]").text(description); $(".js-view-count-work_31245739").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_31245739").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="31245739"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">15</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="445" href="https://www.academia.edu/Documents/in/Computer_Graphics">Computer Graphics</a>, <script data-card-contents-for-ri="445" type="text/json">{"id":445,"name":"Computer Graphics","url":"https://www.academia.edu/Documents/in/Computer_Graphics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="854" href="https://www.academia.edu/Documents/in/Computer_Vision">Computer Vision</a>, <script data-card-contents-for-ri="854" type="text/json">{"id":854,"name":"Computer Vision","url":"https://www.academia.edu/Documents/in/Computer_Vision?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1440" href="https://www.academia.edu/Documents/in/Visualization">Visualization</a><script data-card-contents-for-ri="1440" type="text/json">{"id":1440,"name":"Visualization","url":"https://www.academia.edu/Documents/in/Visualization?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=31245739]'), work: {"id":31245739,"title":"Parallel triangular mesh decimation without sorting","created_at":"2017-02-05T13:01:51.721-08:00","url":"https://www.academia.edu/31245739/Parallel_triangular_mesh_decimation_without_sorting?f_ri=223634","dom_id":"work_31245739","summary":null,"downloadable_attachments":[{"id":51652410,"asset_id":31245739,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":59686925,"first_name":"Vaclav","last_name":"Skala","domain_name":"zcu","page_name":"VaclavSkala","display_name":"Vaclav Skala","profile_url":"https://zcu.academia.edu/VaclavSkala?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false},{"id":445,"name":"Computer Graphics","url":"https://www.academia.edu/Documents/in/Computer_Graphics?f_ri=223634","nofollow":false},{"id":854,"name":"Computer Vision","url":"https://www.academia.edu/Documents/in/Computer_Vision?f_ri=223634","nofollow":false},{"id":1440,"name":"Visualization","url":"https://www.academia.edu/Documents/in/Visualization?f_ri=223634","nofollow":false},{"id":2424,"name":"Computational Geometry","url":"https://www.academia.edu/Documents/in/Computational_Geometry?f_ri=223634"},{"id":3069,"name":"Parallel Programming","url":"https://www.academia.edu/Documents/in/Parallel_Programming?f_ri=223634"},{"id":7973,"name":"Approximation Algorithms","url":"https://www.academia.edu/Documents/in/Approximation_Algorithms?f_ri=223634"},{"id":8252,"name":"Mesh generation","url":"https://www.academia.edu/Documents/in/Mesh_generation?f_ri=223634"},{"id":48591,"name":"Data Visualisation","url":"https://www.academia.edu/Documents/in/Data_Visualisation?f_ri=223634"},{"id":181022,"name":"Data Structures","url":"https://www.academia.edu/Documents/in/Data_Structures?f_ri=223634"},{"id":189056,"name":"Surface Reconstruction","url":"https://www.academia.edu/Documents/in/Surface_Reconstruction?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":264606,"name":"Computer Graphic","url":"https://www.academia.edu/Documents/in/Computer_Graphic?f_ri=223634"},{"id":1931321,"name":"Application Software","url":"https://www.academia.edu/Documents/in/Application_Software?f_ri=223634"},{"id":1957725,"name":"Fast Algorithm","url":"https://www.academia.edu/Documents/in/Fast_Algorithm?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_41845580" data-work_id="41845580" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/41845580/DPM_A_Measurement_System_for_Distributed_Programs">DPM: A Measurement System for Distributed Programs</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">A framework for measuring the performance of distributed programs is presented. This framework includes a model of distributed programs, a description of the measurement principles and methods, and a guideline for implementing these... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_41845580" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">A framework for measuring the performance of distributed programs is presented. This framework includes a model of distributed programs, a description of the measurement principles and methods, and a guideline for implementing these ideas. The author describes a measurement system called the Distributed Programs Monitor (DPM), which he has constructed on the basis of these concepts. DPM has been implemented and used for measurement studies on two different operating systems, DEMOS/MP and Berkeley Unix.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/41845580" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="ce41c554ba46b4ccdab4d14f77d8d866" rel="nofollow" data-download="{"attachment_id":61981038,"asset_id":41845580,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/61981038/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="42269545" href="https://wisc.academia.edu/BartonMiller">Barton Miller</a><script data-card-contents-for-user="42269545" type="text/json">{"id":42269545,"first_name":"Barton","last_name":"Miller","domain_name":"wisc","page_name":"BartonMiller","display_name":"Barton Miller","profile_url":"https://wisc.academia.edu/BartonMiller?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_41845580 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="41845580"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 41845580, container: ".js-paper-rank-work_41845580", }); });</script></li><li class="js-percentile-work_41845580 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 41845580; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_41845580"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_41845580 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="41845580"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 41845580; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=41845580]").text(description); $(".js-view-count-work_41845580").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_41845580").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="41845580"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="440" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2658" href="https://www.academia.edu/Documents/in/Distributed_Algorithms">Distributed Algorithms</a>, <script data-card-contents-for-ri="2658" type="text/json">{"id":2658,"name":"Distributed Algorithms","url":"https://www.academia.edu/Documents/in/Distributed_Algorithms?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="15759" href="https://www.academia.edu/Documents/in/Computer_Hardware">Computer Hardware</a>, <script data-card-contents-for-ri="15759" type="text/json">{"id":15759,"name":"Computer Hardware","url":"https://www.academia.edu/Documents/in/Computer_Hardware?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="17167" href="https://www.academia.edu/Documents/in/Parallel_Processing">Parallel Processing</a><script data-card-contents-for-ri="17167" type="text/json">{"id":17167,"name":"Parallel Processing","url":"https://www.academia.edu/Documents/in/Parallel_Processing?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=41845580]'), work: {"id":41845580,"title":"DPM: A Measurement System for Distributed Programs","created_at":"2020-02-03T16:16:43.967-08:00","url":"https://www.academia.edu/41845580/DPM_A_Measurement_System_for_Distributed_Programs?f_ri=223634","dom_id":"work_41845580","summary":"A framework for measuring the performance of distributed programs is presented. This framework includes a model of distributed programs, a description of the measurement principles and methods, and a guideline for implementing these ideas. The author describes a measurement system called the Distributed Programs Monitor (DPM), which he has constructed on the basis of these concepts. DPM has been implemented and used for measurement studies on two different operating systems, DEMOS/MP and Berkeley Unix.","downloadable_attachments":[{"id":61981038,"asset_id":41845580,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":42269545,"first_name":"Barton","last_name":"Miller","domain_name":"wisc","page_name":"BartonMiller","display_name":"Barton Miller","profile_url":"https://wisc.academia.edu/BartonMiller?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=223634","nofollow":false},{"id":2658,"name":"Distributed Algorithms","url":"https://www.academia.edu/Documents/in/Distributed_Algorithms?f_ri=223634","nofollow":false},{"id":15759,"name":"Computer Hardware","url":"https://www.academia.edu/Documents/in/Computer_Hardware?f_ri=223634","nofollow":false},{"id":17167,"name":"Parallel Processing","url":"https://www.academia.edu/Documents/in/Parallel_Processing?f_ri=223634","nofollow":false},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=223634"},{"id":64716,"name":"Distributed Processing","url":"https://www.academia.edu/Documents/in/Distributed_Processing?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":291387,"name":"Mathematical Model","url":"https://www.academia.edu/Documents/in/Mathematical_Model?f_ri=223634"},{"id":2416066,"name":"Measurement System","url":"https://www.academia.edu/Documents/in/Measurement_System?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_36769745" data-work_id="36769745" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/36769745/Maximizing_revenue_with_allocation_of_multiple_advertisements_on_a_Web_banner">Maximizing revenue with allocation of multiple advertisements on a Web banner</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/36769745" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="cf52b81fb2abbec9aa662228d7c7fb67" rel="nofollow" data-download="{"attachment_id":56718144,"asset_id":36769745,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/56718144/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="8974650" href="https://eur.academia.edu/FlaviusFrasincar">Flavius Frasincar</a><script data-card-contents-for-user="8974650" type="text/json">{"id":8974650,"first_name":"Flavius","last_name":"Frasincar","domain_name":"eur","page_name":"FlaviusFrasincar","display_name":"Flavius Frasincar","profile_url":"https://eur.academia.edu/FlaviusFrasincar?f_ri=223634","photo":"https://0.academia-photos.com/8974650/19861014/19681114/s65_flavius.frasincar.png"}</script></span></span></li><li class="js-paper-rank-work_36769745 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="36769745"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 36769745, container: ".js-paper-rank-work_36769745", }); });</script></li><li class="js-percentile-work_36769745 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 36769745; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_36769745"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_36769745 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="36769745"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 36769745; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=36769745]").text(description); $(".js-view-count-work_36769745").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_36769745").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="36769745"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="305" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2537" href="https://www.academia.edu/Documents/in/Heuristics">Heuristics</a>, <script data-card-contents-for-ri="2537" type="text/json">{"id":2537,"name":"Heuristics","url":"https://www.academia.edu/Documents/in/Heuristics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3637" href="https://www.academia.edu/Documents/in/Advertising">Advertising</a>, <script data-card-contents-for-ri="3637" type="text/json">{"id":3637,"name":"Advertising","url":"https://www.academia.edu/Documents/in/Advertising?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="21747" href="https://www.academia.edu/Documents/in/Experimental_Design">Experimental Design</a><script data-card-contents-for-ri="21747" type="text/json">{"id":21747,"name":"Experimental Design","url":"https://www.academia.edu/Documents/in/Experimental_Design?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=36769745]'), work: {"id":36769745,"title":"Maximizing revenue with allocation of multiple advertisements on a Web banner","created_at":"2018-06-03T09:05:16.018-07:00","url":"https://www.academia.edu/36769745/Maximizing_revenue_with_allocation_of_multiple_advertisements_on_a_Web_banner?f_ri=223634","dom_id":"work_36769745","summary":null,"downloadable_attachments":[{"id":56718144,"asset_id":36769745,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":8974650,"first_name":"Flavius","last_name":"Frasincar","domain_name":"eur","page_name":"FlaviusFrasincar","display_name":"Flavius Frasincar","profile_url":"https://eur.academia.edu/FlaviusFrasincar?f_ri=223634","photo":"https://0.academia-photos.com/8974650/19861014/19681114/s65_flavius.frasincar.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=223634","nofollow":false},{"id":2537,"name":"Heuristics","url":"https://www.academia.edu/Documents/in/Heuristics?f_ri=223634","nofollow":false},{"id":3637,"name":"Advertising","url":"https://www.academia.edu/Documents/in/Advertising?f_ri=223634","nofollow":false},{"id":21747,"name":"Experimental Design","url":"https://www.academia.edu/Documents/in/Experimental_Design?f_ri=223634","nofollow":false},{"id":141114,"name":"World Wide Web","url":"https://www.academia.edu/Documents/in/World_Wide_Web?f_ri=223634"},{"id":143100,"name":"Temporal Constraints","url":"https://www.academia.edu/Documents/in/Temporal_Constraints?f_ri=223634"},{"id":167483,"name":"Income","url":"https://www.academia.edu/Documents/in/Income?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":556845,"name":"Numerical Analysis and Computational Mathematics","url":"https://www.academia.edu/Documents/in/Numerical_Analysis_and_Computational_Mathematics?f_ri=223634"},{"id":893452,"name":"Greedy Algorithm","url":"https://www.academia.edu/Documents/in/Greedy_Algorithm?f_ri=223634"},{"id":902401,"name":"Pattern Generation","url":"https://www.academia.edu/Documents/in/Pattern_Generation?f_ri=223634"},{"id":1191356,"name":"Internet","url":"https://www.academia.edu/Documents/in/Internet?f_ri=223634"},{"id":1707689,"name":"Pixel","url":"https://www.academia.edu/Documents/in/Pixel?f_ri=223634"},{"id":1950746,"name":"Heuristic algorithm","url":"https://www.academia.edu/Documents/in/Heuristic_algorithm?f_ri=223634"},{"id":1993320,"name":"Optimal Solution","url":"https://www.academia.edu/Documents/in/Optimal_Solution?f_ri=223634"},{"id":2221688,"name":"Knapsack Problem","url":"https://www.academia.edu/Documents/in/Knapsack_Problem?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_49910308" data-work_id="49910308" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/49910308/Scalability_of_Data_Binding_in_ASP_NET_Web_Applications">Scalability of Data Binding in ASP. NET Web Applications</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Abstract: ASP .NET web applications typically employ server controls to provide dynamic web pages, and data-bound server controls to display and maintain database data. Most developers use default properties of ASP .NET server controls... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_49910308" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Abstract: ASP .NET web applications typically employ server controls to provide dynamic web pages, and data-bound server controls to display and maintain database data. Most developers use default properties of ASP .NET server controls when developing web applications, which allows for rapid development of workable applications. However, creating a high-performance, multi-user, and scalable web application requires enhancement of server controls using custom-made code. In this empirical study we ...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/49910308" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="48ef2801236b1728fe69490c67fa85b2" rel="nofollow" data-download="{"attachment_id":68091707,"asset_id":49910308,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/68091707/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="149768178" href="https://uppr.academia.edu/MarkoVuckovic">Marko Vuckovic</a><script data-card-contents-for-user="149768178" type="text/json">{"id":149768178,"first_name":"Marko","last_name":"Vuckovic","domain_name":"uppr","page_name":"MarkoVuckovic","display_name":"Marko Vuckovic","profile_url":"https://uppr.academia.edu/MarkoVuckovic?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_49910308 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="49910308"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 49910308, container: ".js-paper-rank-work_49910308", }); });</script></li><li class="js-percentile-work_49910308 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 49910308; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_49910308"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_49910308 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="49910308"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 49910308; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=49910308]").text(description); $(".js-view-count-work_49910308").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_49910308").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="49910308"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a>, <script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="377043" href="https://www.academia.edu/Documents/in/Scalability">Scalability</a>, <script data-card-contents-for-ri="377043" type="text/json">{"id":377043,"name":"Scalability","url":"https://www.academia.edu/Documents/in/Scalability?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="481229" href="https://www.academia.edu/Documents/in/Web_Pages">Web Pages</a>, <script data-card-contents-for-ri="481229" type="text/json">{"id":481229,"name":"Web Pages","url":"https://www.academia.edu/Documents/in/Web_Pages?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1006047" href="https://www.academia.edu/Documents/in/Indexes">Indexes</a><script data-card-contents-for-ri="1006047" type="text/json">{"id":1006047,"name":"Indexes","url":"https://www.academia.edu/Documents/in/Indexes?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=49910308]'), work: {"id":49910308,"title":"Scalability of Data Binding in ASP. NET Web Applications","created_at":"2021-07-14T10:23:52.236-07:00","url":"https://www.academia.edu/49910308/Scalability_of_Data_Binding_in_ASP_NET_Web_Applications?f_ri=223634","dom_id":"work_49910308","summary":"Abstract: ASP .NET web applications typically employ server controls to provide dynamic web pages, and data-bound server controls to display and maintain database data. Most developers use default properties of ASP .NET server controls when developing web applications, which allows for rapid development of workable applications. However, creating a high-performance, multi-user, and scalable web application requires enhancement of server controls using custom-made code. In this empirical study we ...","downloadable_attachments":[{"id":68091707,"asset_id":49910308,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":149768178,"first_name":"Marko","last_name":"Vuckovic","domain_name":"uppr","page_name":"MarkoVuckovic","display_name":"Marko Vuckovic","profile_url":"https://uppr.academia.edu/MarkoVuckovic?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false},{"id":377043,"name":"Scalability","url":"https://www.academia.edu/Documents/in/Scalability?f_ri=223634","nofollow":false},{"id":481229,"name":"Web Pages","url":"https://www.academia.edu/Documents/in/Web_Pages?f_ri=223634","nofollow":false},{"id":1006047,"name":"Indexes","url":"https://www.academia.edu/Documents/in/Indexes?f_ri=223634","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_64984318" data-work_id="64984318" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/64984318/Evolution_and_trends_in_GPU_computing">Evolution and trends in GPU computing</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">ABSTRACT Central Processing Units (CPUs) are task-parallel, latency-oriented processors, while Graphics Processing Units (GPUs) are data-parallel, throughput oriented processors. Besides their traditional use as graphics coprocessors, the... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_64984318" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">ABSTRACT Central Processing Units (CPUs) are task-parallel, latency-oriented processors, while Graphics Processing Units (GPUs) are data-parallel, throughput oriented processors. Besides their traditional use as graphics coprocessors, the GPUs have been used in recent years for general purpose computations, too. Rapid development of graphics hardware led to an extensive use in both scientific and commercial applications. Numerous papers report high speedups in various domains. This paper presents an effort to bring GPU computing closer to programmers and wider community of users. GPU computing is explored through NVIDIA Compute Unified Device Architecture (CUDA) that is currently the most mature application programming interface (API) for general purpose computation on GPUs.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/64984318" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="15248863" href="https://independent.academia.edu/%C4%90or%C4%91e%C4%90ur%C4%91evi%C4%87">Đorđe Đurđević</a><script data-card-contents-for-user="15248863" type="text/json">{"id":15248863,"first_name":"Đorđe","last_name":"Đurđević","domain_name":"independent","page_name":"ĐorđeĐurđević","display_name":"Đorđe Đurđević","profile_url":"https://independent.academia.edu/%C4%90or%C4%91e%C4%90ur%C4%91evi%C4%87?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_64984318 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="64984318"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 64984318, container: ".js-paper-rank-work_64984318", }); });</script></li><li class="js-percentile-work_64984318 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 64984318; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_64984318"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_64984318 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="64984318"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 64984318; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=64984318]").text(description); $(".js-view-count-work_64984318").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_64984318").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="64984318"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="12225" href="https://www.academia.edu/Documents/in/GPU_Computing">GPU Computing</a>, <script data-card-contents-for-ri="12225" type="text/json">{"id":12225,"name":"GPU Computing","url":"https://www.academia.edu/Documents/in/GPU_Computing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="53292" href="https://www.academia.edu/Documents/in/Programming">Programming</a>, <script data-card-contents-for-ri="53292" type="text/json">{"id":53292,"name":"Programming","url":"https://www.academia.edu/Documents/in/Programming?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="69541" href="https://www.academia.edu/Documents/in/CPU">CPU</a>, <script data-card-contents-for-ri="69541" type="text/json">{"id":69541,"name":"CPU","url":"https://www.academia.edu/Documents/in/CPU?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="91936" href="https://www.academia.edu/Documents/in/Hardware">Hardware</a><script data-card-contents-for-ri="91936" type="text/json">{"id":91936,"name":"Hardware","url":"https://www.academia.edu/Documents/in/Hardware?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=64984318]'), work: {"id":64984318,"title":"Evolution and trends in GPU computing","created_at":"2021-12-18T07:25:56.166-08:00","url":"https://www.academia.edu/64984318/Evolution_and_trends_in_GPU_computing?f_ri=223634","dom_id":"work_64984318","summary":"ABSTRACT Central Processing Units (CPUs) are task-parallel, latency-oriented processors, while Graphics Processing Units (GPUs) are data-parallel, throughput oriented processors. Besides their traditional use as graphics coprocessors, the GPUs have been used in recent years for general purpose computations, too. Rapid development of graphics hardware led to an extensive use in both scientific and commercial applications. Numerous papers report high speedups in various domains. This paper presents an effort to bring GPU computing closer to programmers and wider community of users. GPU computing is explored through NVIDIA Compute Unified Device Architecture (CUDA) that is currently the most mature application programming interface (API) for general purpose computation on GPUs.","downloadable_attachments":[],"ordered_authors":[{"id":15248863,"first_name":"Đorđe","last_name":"Đurđević","domain_name":"independent","page_name":"ĐorđeĐurđević","display_name":"Đorđe Đurđević","profile_url":"https://independent.academia.edu/%C4%90or%C4%91e%C4%90ur%C4%91evi%C4%87?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":12225,"name":"GPU Computing","url":"https://www.academia.edu/Documents/in/GPU_Computing?f_ri=223634","nofollow":false},{"id":53292,"name":"Programming","url":"https://www.academia.edu/Documents/in/Programming?f_ri=223634","nofollow":false},{"id":69541,"name":"CPU","url":"https://www.academia.edu/Documents/in/CPU?f_ri=223634","nofollow":false},{"id":91936,"name":"Hardware","url":"https://www.academia.edu/Documents/in/Hardware?f_ri=223634","nofollow":false},{"id":183272,"name":"Api","url":"https://www.academia.edu/Documents/in/Api?f_ri=223634"},{"id":191487,"name":"Kernel","url":"https://www.academia.edu/Documents/in/Kernel?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":1192160,"name":"Instruction Sets","url":"https://www.academia.edu/Documents/in/Instruction_Sets?f_ri=223634"},{"id":2424316,"name":"Application Programming Interface (API)","url":"https://www.academia.edu/Documents/in/Application_Programming_Interface_API_?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_9377370 coauthored" data-work_id="9377370" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/9377370/Matching_Nuts_and_Bolts_Faster">Matching Nuts and Bolts Faster</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The problem of matching nuts and bolts is the following: Given a collection of n nuts of distinct sizes and n bolts such that there is a one-to-one correspondence between the nuts and the bolts, find for each nut its corresponding bolt.... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_9377370" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The problem of matching nuts and bolts is the following: Given a collection of n nuts of distinct sizes and n bolts such that there is a one-to-one correspondence between the nuts and the bolts, find for each nut its corresponding bolt. We can only compare nuts to bolts. That is we can neither compare nuts to nuts, nor bolts to bolts. This humble restriction on the comparisons appears to make this problem very hard to solve. In fact, the best deterministic solution published to date is due to Alon et al. [2] and takes θ(n log4 n) time. Their solution uses (efficient) graph expanders. In this paper, we give a simpler O(n log2 n) time algorithm which uses only a simple (and not so efficient) expander.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/9377370" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a45c83a11b2a21926eb950c781a1839e" rel="nofollow" data-download="{"attachment_id":38982040,"asset_id":9377370,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/38982040/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="36699325" href="https://independent.academia.edu/FleischerRudolf">Rudolf Fleischer</a><script data-card-contents-for-user="36699325" type="text/json">{"id":36699325,"first_name":"Rudolf","last_name":"Fleischer","domain_name":"independent","page_name":"FleischerRudolf","display_name":"Rudolf Fleischer","profile_url":"https://independent.academia.edu/FleischerRudolf?f_ri=223634","photo":"https://0.academia-photos.com/36699325/18796062/18756398/s65_rudolf.fleischer.jpg"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-9377370">+1</span><div class="hidden js-additional-users-9377370"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://stamford-uconn.academia.edu/PhillipBradford">Phillip Bradford</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-9377370'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-9377370').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_9377370 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="9377370"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 9377370, container: ".js-paper-rank-work_9377370", }); });</script></li><li class="js-percentile-work_9377370 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 9377370; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_9377370"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_9377370 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="9377370"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 9377370; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=9377370]").text(description); $(".js-view-count-work_9377370").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_9377370").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="9377370"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="80414" href="https://www.academia.edu/Documents/in/Mathematical_Sciences">Mathematical Sciences</a>, <script data-card-contents-for-ri="80414" type="text/json">{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="168640" href="https://www.academia.edu/Documents/in/Analysis_of_Algorithms">Analysis of Algorithms</a>, <script data-card-contents-for-ri="168640" type="text/json">{"id":168640,"name":"Analysis of Algorithms","url":"https://www.academia.edu/Documents/in/Analysis_of_Algorithms?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a><script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=9377370]'), work: {"id":9377370,"title":"Matching Nuts and Bolts Faster","created_at":"2014-11-18T11:13:16.302-08:00","url":"https://www.academia.edu/9377370/Matching_Nuts_and_Bolts_Faster?f_ri=223634","dom_id":"work_9377370","summary":"The problem of matching nuts and bolts is the following: Given a collection of n nuts of distinct sizes and n bolts such that there is a one-to-one correspondence between the nuts and the bolts, find for each nut its corresponding bolt. We can only compare nuts to bolts. That is we can neither compare nuts to nuts, nor bolts to bolts. This humble restriction on the comparisons appears to make this problem very hard to solve. In fact, the best deterministic solution published to date is due to Alon et al. [2] and takes θ(n log4 n) time. Their solution uses (efficient) graph expanders. In this paper, we give a simpler O(n log2 n) time algorithm which uses only a simple (and not so efficient) expander.","downloadable_attachments":[{"id":38982040,"asset_id":9377370,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":36699325,"first_name":"Rudolf","last_name":"Fleischer","domain_name":"independent","page_name":"FleischerRudolf","display_name":"Rudolf Fleischer","profile_url":"https://independent.academia.edu/FleischerRudolf?f_ri=223634","photo":"https://0.academia-photos.com/36699325/18796062/18756398/s65_rudolf.fleischer.jpg"},{"id":21743301,"first_name":"Phillip","last_name":"Bradford","domain_name":"stamford-uconn","page_name":"PhillipBradford","display_name":"Phillip Bradford","profile_url":"https://stamford-uconn.academia.edu/PhillipBradford?f_ri=223634","photo":"https://0.academia-photos.com/21743301/5977385/6783528/s65_phillip.bradford.jpg_oh_8ce6dfacdea8a1118c65926f038a801b_oe_54d21f84___gda___1427749228_d867513543e43b3abf2773473481729f"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=223634","nofollow":false},{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=223634","nofollow":false},{"id":168640,"name":"Analysis of Algorithms","url":"https://www.academia.edu/Documents/in/Analysis_of_Algorithms?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_14512840" data-work_id="14512840" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/14512840/Network_hub_location_problems_The_state_of_the_art">Network hub location problems: The state of the art</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/14512840" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="ce9fc96432dd27abf52e7b298b97681b" rel="nofollow" data-download="{"attachment_id":44102774,"asset_id":14512840,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/44102774/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="33465955" href="https://uwaterloo.academia.edu/SibelAlumur">Sibel Alumur</a><script data-card-contents-for-user="33465955" type="text/json">{"id":33465955,"first_name":"Sibel","last_name":"Alumur","domain_name":"uwaterloo","page_name":"SibelAlumur","display_name":"Sibel Alumur","profile_url":"https://uwaterloo.academia.edu/SibelAlumur?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_14512840 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="14512840"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 14512840, container: ".js-paper-rank-work_14512840", }); });</script></li><li class="js-percentile-work_14512840 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 14512840; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_14512840"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_14512840 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="14512840"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 14512840; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=14512840]").text(description); $(".js-view-count-work_14512840").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_14512840").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="14512840"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="4974" href="https://www.academia.edu/Documents/in/Logistics">Logistics</a>, <script data-card-contents-for-ri="4974" type="text/json">{"id":4974,"name":"Logistics","url":"https://www.academia.edu/Documents/in/Logistics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="10194" href="https://www.academia.edu/Documents/in/Localization">Localization</a>, <script data-card-contents-for-ri="10194" type="text/json">{"id":10194,"name":"Localization","url":"https://www.academia.edu/Documents/in/Localization?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="22686" href="https://www.academia.edu/Documents/in/Distributed_System">Distributed System</a>, <script data-card-contents-for-ri="22686" type="text/json">{"id":22686,"name":"Distributed System","url":"https://www.academia.edu/Documents/in/Distributed_System?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="28235" href="https://www.academia.edu/Documents/in/Multidisciplinary">Multidisciplinary</a><script data-card-contents-for-ri="28235" type="text/json">{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=14512840]'), work: {"id":14512840,"title":"Network hub location problems: The state of the art","created_at":"2015-07-30T09:32:32.933-07:00","url":"https://www.academia.edu/14512840/Network_hub_location_problems_The_state_of_the_art?f_ri=223634","dom_id":"work_14512840","summary":null,"downloadable_attachments":[{"id":44102774,"asset_id":14512840,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":33465955,"first_name":"Sibel","last_name":"Alumur","domain_name":"uwaterloo","page_name":"SibelAlumur","display_name":"Sibel Alumur","profile_url":"https://uwaterloo.academia.edu/SibelAlumur?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":4974,"name":"Logistics","url":"https://www.academia.edu/Documents/in/Logistics?f_ri=223634","nofollow":false},{"id":10194,"name":"Localization","url":"https://www.academia.edu/Documents/in/Localization?f_ri=223634","nofollow":false},{"id":22686,"name":"Distributed System","url":"https://www.academia.edu/Documents/in/Distributed_System?f_ri=223634","nofollow":false},{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary?f_ri=223634","nofollow":false},{"id":48576,"name":"Switching","url":"https://www.academia.edu/Documents/in/Switching?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":555142,"name":"Origin-Destination Matrix","url":"https://www.academia.edu/Documents/in/Origin-Destination_Matrix?f_ri=223634"},{"id":1112402,"name":"Location Model","url":"https://www.academia.edu/Documents/in/Location_Model?f_ri=223634"},{"id":1160956,"name":"Location Problem","url":"https://www.academia.edu/Documents/in/Location_Problem?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_14711028" data-work_id="14711028" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/14711028/SELECTION_SORTING_ALGORITHM_VISUALIZATION_USING_FLASH">SELECTION SORTING ALGORITHM VISUALIZATION USING FLASH</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This paper is intended to develop an algorithm visualization, particularly selection sorting for an Algorithm and Programming course. Algorithm visualization technology graphically illustrates how algorithms work. This visualization can... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_14711028" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This paper is intended to develop an algorithm visualization, particularly selection sorting for an Algorithm and Programming course. Algorithm visualization technology graphically illustrates how algorithms work. This visualization can be used to explain how all data move to the proper position in order to be sorted in a display computer for education. This research consists of 6 steps which are concept, design, obtaining content material, <br />assembly, testing, and distribution. During the testing step, the application is run and checked to confirm that it performs exactly what the author has intended and the students can learn selection sorting algorithm by studying the visualization. Subjects of the research were students at Department of Informatics Universitas Persada Indonesia YAI for implementation of the learning. The data were analysed using the analytic descriptive method and interpreted in a narrative way based on the research findings. The algorithm visualization indicates that students increase their motivation and ability to program variety of sorting in programming language they learn.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/14711028" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f46f7357f52c16a8788f742f46250617" rel="nofollow" data-download="{"attachment_id":38398785,"asset_id":14711028,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/38398785/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="21274538" href="https://independent.academia.edu/journal">The International Journal of Multimedia (IJMA) - ERA Indexed</a><script data-card-contents-for-user="21274538" type="text/json">{"id":21274538,"first_name":"The International Journal of Multimedia","last_name":"(IJMA) - ERA Indexed","domain_name":"independent","page_name":"journal","display_name":"The International Journal of Multimedia (IJMA) - ERA Indexed","profile_url":"https://independent.academia.edu/journal?f_ri=223634","photo":"https://0.academia-photos.com/21274538/5930840/74440279/s65_the_international_journal_of_multimedia_its_applications._ijma_-_era_indexed.png"}</script></span></span></li><li class="js-paper-rank-work_14711028 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="14711028"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 14711028, container: ".js-paper-rank-work_14711028", }); });</script></li><li class="js-percentile-work_14711028 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 14711028; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_14711028"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_14711028 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="14711028"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 14711028; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=14711028]").text(description); $(".js-view-count-work_14711028").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_14711028").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="14711028"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="3419" href="https://www.academia.edu/Documents/in/Multimedia">Multimedia</a>, <script data-card-contents-for-ri="3419" type="text/json">{"id":3419,"name":"Multimedia","url":"https://www.academia.edu/Documents/in/Multimedia?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3593" href="https://www.academia.edu/Documents/in/ActionScript">ActionScript</a>, <script data-card-contents-for-ri="3593" type="text/json">{"id":3593,"name":"ActionScript","url":"https://www.academia.edu/Documents/in/ActionScript?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="26817" href="https://www.academia.edu/Documents/in/Algorithm">Algorithm</a>, <script data-card-contents-for-ri="26817" type="text/json">{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a><script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=14711028]'), work: {"id":14711028,"title":"SELECTION SORTING ALGORITHM VISUALIZATION USING FLASH","created_at":"2015-08-06T02:54:08.775-07:00","url":"https://www.academia.edu/14711028/SELECTION_SORTING_ALGORITHM_VISUALIZATION_USING_FLASH?f_ri=223634","dom_id":"work_14711028","summary":"This paper is intended to develop an algorithm visualization, particularly selection sorting for an Algorithm and Programming course. Algorithm visualization technology graphically illustrates how algorithms work. This visualization can be used to explain how all data move to the proper position in order to be sorted in a display computer for education. This research consists of 6 steps which are concept, design, obtaining content material, \nassembly, testing, and distribution. During the testing step, the application is run and checked to confirm that it performs exactly what the author has intended and the students can learn selection sorting algorithm by studying the visualization. Subjects of the research were students at Department of Informatics Universitas Persada Indonesia YAI for implementation of the learning. The data were analysed using the analytic descriptive method and interpreted in a narrative way based on the research findings. The algorithm visualization indicates that students increase their motivation and ability to program variety of sorting in programming language they learn.","downloadable_attachments":[{"id":38398785,"asset_id":14711028,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":21274538,"first_name":"The International Journal of Multimedia","last_name":"(IJMA) - ERA Indexed","domain_name":"independent","page_name":"journal","display_name":"The International Journal of Multimedia (IJMA) - ERA Indexed","profile_url":"https://independent.academia.edu/journal?f_ri=223634","photo":"https://0.academia-photos.com/21274538/5930840/74440279/s65_the_international_journal_of_multimedia_its_applications._ijma_-_era_indexed.png"}],"research_interests":[{"id":3419,"name":"Multimedia","url":"https://www.academia.edu/Documents/in/Multimedia?f_ri=223634","nofollow":false},{"id":3593,"name":"ActionScript","url":"https://www.academia.edu/Documents/in/ActionScript?f_ri=223634","nofollow":false},{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_27056404" data-work_id="27056404" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/27056404/Using_SIMD_registers_and_instructions_to_enable_instruction_level_parallelism_in_sorting_algorithms">Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/27056404" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="ca70d5f681d727be8760533a1a7c1b89" rel="nofollow" data-download="{"attachment_id":47311134,"asset_id":27056404,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47311134/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="51098195" href="https://independent.academia.edu/TimothyFurtak">Timothy Furtak</a><script data-card-contents-for-user="51098195" type="text/json">{"id":51098195,"first_name":"Timothy","last_name":"Furtak","domain_name":"independent","page_name":"TimothyFurtak","display_name":"Timothy Furtak","profile_url":"https://independent.academia.edu/TimothyFurtak?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_27056404 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="27056404"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 27056404, container: ".js-paper-rank-work_27056404", }); });</script></li><li class="js-percentile-work_27056404 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 27056404; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_27056404"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_27056404 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="27056404"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 27056404; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=27056404]").text(description); $(".js-view-count-work_27056404").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_27056404").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="27056404"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="135177" href="https://www.academia.edu/Documents/in/Code_Generation">Code Generation</a>, <script data-card-contents-for-ri="135177" type="text/json">{"id":135177,"name":"Code Generation","url":"https://www.academia.edu/Documents/in/Code_Generation?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a>, <script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="585882" href="https://www.academia.edu/Documents/in/Sorting_Algorithm">Sorting Algorithm</a>, <script data-card-contents-for-ri="585882" type="text/json">{"id":585882,"name":"Sorting Algorithm","url":"https://www.academia.edu/Documents/in/Sorting_Algorithm?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1006301" href="https://www.academia.edu/Documents/in/SIMD">SIMD</a><script data-card-contents-for-ri="1006301" type="text/json">{"id":1006301,"name":"SIMD","url":"https://www.academia.edu/Documents/in/SIMD?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=27056404]'), work: {"id":27056404,"title":"Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms","created_at":"2016-07-17T21:22:09.010-07:00","url":"https://www.academia.edu/27056404/Using_SIMD_registers_and_instructions_to_enable_instruction_level_parallelism_in_sorting_algorithms?f_ri=223634","dom_id":"work_27056404","summary":null,"downloadable_attachments":[{"id":47311134,"asset_id":27056404,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":51098195,"first_name":"Timothy","last_name":"Furtak","domain_name":"independent","page_name":"TimothyFurtak","display_name":"Timothy Furtak","profile_url":"https://independent.academia.edu/TimothyFurtak?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":135177,"name":"Code Generation","url":"https://www.academia.edu/Documents/in/Code_Generation?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false},{"id":585882,"name":"Sorting Algorithm","url":"https://www.academia.edu/Documents/in/Sorting_Algorithm?f_ri=223634","nofollow":false},{"id":1006301,"name":"SIMD","url":"https://www.academia.edu/Documents/in/SIMD?f_ri=223634","nofollow":false},{"id":1553599,"name":"Instruction Level Parallelism","url":"https://www.academia.edu/Documents/in/Instruction_Level_Parallelism?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_33090326" data-work_id="33090326" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/33090326/Zero_delay_FPGA_based_odd_even_sorting_network">Zero-delay FPGA-based odd-even sorting network</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/33090326" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="faf2898ab716e3a4e96fa0c3289df69f" rel="nofollow" data-download="{"attachment_id":53189826,"asset_id":33090326,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/53189826/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="33485460" href="https://independent.academia.edu/nparsazadeh">n parsazadeh</a><script data-card-contents-for-user="33485460" type="text/json">{"id":33485460,"first_name":"n","last_name":"parsazadeh","domain_name":"independent","page_name":"nparsazadeh","display_name":"n parsazadeh","profile_url":"https://independent.academia.edu/nparsazadeh?f_ri=223634","photo":"https://0.academia-photos.com/33485460/113467844/102739000/s65_n.parsazadeh.png"}</script></span></span></li><li class="js-paper-rank-work_33090326 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="33090326"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 33090326, container: ".js-paper-rank-work_33090326", }); });</script></li><li class="js-percentile-work_33090326 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 33090326; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_33090326"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_33090326 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="33090326"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 33090326; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=33090326]").text(description); $(".js-view-count-work_33090326").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_33090326").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="33090326"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="442" href="https://www.academia.edu/Documents/in/Parallel_Computing">Parallel Computing</a>, <script data-card-contents-for-ri="442" type="text/json">{"id":442,"name":"Parallel Computing","url":"https://www.academia.edu/Documents/in/Parallel_Computing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1185" href="https://www.academia.edu/Documents/in/Image_Processing">Image Processing</a>, <script data-card-contents-for-ri="1185" type="text/json">{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1210" href="https://www.academia.edu/Documents/in/Informatics">Informatics</a>, <script data-card-contents-for-ri="1210" type="text/json">{"id":1210,"name":"Informatics","url":"https://www.academia.edu/Documents/in/Informatics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5697" href="https://www.academia.edu/Documents/in/FPGA">FPGA</a><script data-card-contents-for-ri="5697" type="text/json">{"id":5697,"name":"FPGA","url":"https://www.academia.edu/Documents/in/FPGA?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=33090326]'), work: {"id":33090326,"title":"Zero-delay FPGA-based odd-even sorting network","created_at":"2017-05-18T23:20:04.832-07:00","url":"https://www.academia.edu/33090326/Zero_delay_FPGA_based_odd_even_sorting_network?f_ri=223634","dom_id":"work_33090326","summary":null,"downloadable_attachments":[{"id":53189826,"asset_id":33090326,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":33485460,"first_name":"n","last_name":"parsazadeh","domain_name":"independent","page_name":"nparsazadeh","display_name":"n parsazadeh","profile_url":"https://independent.academia.edu/nparsazadeh?f_ri=223634","photo":"https://0.academia-photos.com/33485460/113467844/102739000/s65_n.parsazadeh.png"}],"research_interests":[{"id":442,"name":"Parallel Computing","url":"https://www.academia.edu/Documents/in/Parallel_Computing?f_ri=223634","nofollow":false},{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=223634","nofollow":false},{"id":1210,"name":"Informatics","url":"https://www.academia.edu/Documents/in/Informatics?f_ri=223634","nofollow":false},{"id":5697,"name":"FPGA","url":"https://www.academia.edu/Documents/in/FPGA?f_ri=223634","nofollow":false},{"id":17194,"name":"Field-Programmable Gate Arrays","url":"https://www.academia.edu/Documents/in/Field-Programmable_Gate_Arrays?f_ri=223634"},{"id":59249,"name":"Computers","url":"https://www.academia.edu/Documents/in/Computers?f_ri=223634"},{"id":155196,"name":"Median Filter","url":"https://www.academia.edu/Documents/in/Median_Filter?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":229390,"name":"Real Time","url":"https://www.academia.edu/Documents/in/Real_Time?f_ri=223634"},{"id":2064516,"name":"Combinational Circuits","url":"https://www.academia.edu/Documents/in/Combinational_Circuits?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_8072620" data-work_id="8072620" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/8072620/An_alternative_time_optimal_distributed_sorting_algorithm_on_a_line_network">An alternative time — optimal distributed sorting algorithm on a line network</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/8072620" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="4d74d52b219b7431f511c6da3c2c50ed" rel="nofollow" data-download="{"attachment_id":48224141,"asset_id":8072620,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48224141/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="15590851" href="https://independent.academia.edu/RajendraPrasath2">Rajendra Prasath</a><script data-card-contents-for-user="15590851" type="text/json">{"id":15590851,"first_name":"Rajendra","last_name":"Prasath","domain_name":"independent","page_name":"RajendraPrasath2","display_name":"Rajendra Prasath","profile_url":"https://independent.academia.edu/RajendraPrasath2?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_8072620 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="8072620"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 8072620, container: ".js-paper-rank-work_8072620", }); });</script></li><li class="js-percentile-work_8072620 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 8072620; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_8072620"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_8072620 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="8072620"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 8072620; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=8072620]").text(description); $(".js-view-count-work_8072620").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_8072620").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="8072620"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">17</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="440" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="459" href="https://www.academia.edu/Documents/in/Information_Science">Information Science</a>, <script data-card-contents-for-ri="459" type="text/json">{"id":459,"name":"Information Science","url":"https://www.academia.edu/Documents/in/Information_Science?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2189" href="https://www.academia.edu/Documents/in/Computational_Complexity">Computational Complexity</a><script data-card-contents-for-ri="2189" type="text/json">{"id":2189,"name":"Computational Complexity","url":"https://www.academia.edu/Documents/in/Computational_Complexity?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=8072620]'), work: {"id":8072620,"title":"An alternative time — optimal distributed sorting algorithm on a line network","created_at":"2014-08-24T19:03:13.857-07:00","url":"https://www.academia.edu/8072620/An_alternative_time_optimal_distributed_sorting_algorithm_on_a_line_network?f_ri=223634","dom_id":"work_8072620","summary":null,"downloadable_attachments":[{"id":48224141,"asset_id":8072620,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":15590851,"first_name":"Rajendra","last_name":"Prasath","domain_name":"independent","page_name":"RajendraPrasath2","display_name":"Rajendra Prasath","profile_url":"https://independent.academia.edu/RajendraPrasath2?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false},{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=223634","nofollow":false},{"id":459,"name":"Information Science","url":"https://www.academia.edu/Documents/in/Information_Science?f_ri=223634","nofollow":false},{"id":2189,"name":"Computational Complexity","url":"https://www.academia.edu/Documents/in/Computational_Complexity?f_ri=223634","nofollow":false},{"id":2658,"name":"Distributed Algorithms","url":"https://www.academia.edu/Documents/in/Distributed_Algorithms?f_ri=223634"},{"id":2950,"name":"Computational Modeling","url":"https://www.academia.edu/Documents/in/Computational_Modeling?f_ri=223634"},{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=223634"},{"id":5473,"name":"Embedded Systems","url":"https://www.academia.edu/Documents/in/Embedded_Systems?f_ri=223634"},{"id":22686,"name":"Distributed System","url":"https://www.academia.edu/Documents/in/Distributed_System?f_ri=223634"},{"id":36837,"name":"Information Processing","url":"https://www.academia.edu/Documents/in/Information_Processing?f_ri=223634"},{"id":149059,"name":"Efficient Algorithm for ECG Coding","url":"https://www.academia.edu/Documents/in/Efficient_Algorithm_for_ECG_Coding?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":279495,"name":"Robustness","url":"https://www.academia.edu/Documents/in/Robustness?f_ri=223634"},{"id":539410,"name":"Network Topology","url":"https://www.academia.edu/Documents/in/Network_Topology?f_ri=223634"},{"id":571143,"name":"Lower Bound","url":"https://www.academia.edu/Documents/in/Lower_Bound?f_ri=223634"},{"id":585882,"name":"Sorting Algorithm","url":"https://www.academia.edu/Documents/in/Sorting_Algorithm?f_ri=223634"},{"id":1209324,"name":"Timing Optimization","url":"https://www.academia.edu/Documents/in/Timing_Optimization?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_1074781" data-work_id="1074781" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/1074781/A_super_efficient_adaptable_bit_reversal_algorithm_for_multithreaded_architectures">A super-efficient adaptable bit-reversal algorithm for multithreaded architectures</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/1074781" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="ae876b491a4365dd44eb916614388429" rel="nofollow" data-download="{"attachment_id":34504646,"asset_id":1074781,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/34504646/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="923324" href="https://ntnu-no.academia.edu/AnneCElster">Anne C. Elster</a><script data-card-contents-for-user="923324" type="text/json">{"id":923324,"first_name":"Anne C.","last_name":"Elster","domain_name":"ntnu-no","page_name":"AnneCElster","display_name":"Anne C. Elster","profile_url":"https://ntnu-no.academia.edu/AnneCElster?f_ri=223634","photo":"https://0.academia-photos.com/923324/345235/7836938/s65_anne_c..elster.jpg"}</script></span></span></li><li class="js-paper-rank-work_1074781 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="1074781"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 1074781, container: ".js-paper-rank-work_1074781", }); });</script></li><li class="js-percentile-work_1074781 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 1074781; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_1074781"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_1074781 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="1074781"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 1074781; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=1074781]").text(description); $(".js-view-count-work_1074781").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_1074781").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="1074781"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="433" href="https://www.academia.edu/Documents/in/Computer_Architecture">Computer Architecture</a>, <script data-card-contents-for-ri="433" type="text/json">{"id":433,"name":"Computer Architecture","url":"https://www.academia.edu/Documents/in/Computer_Architecture?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="459" href="https://www.academia.edu/Documents/in/Information_Science">Information Science</a>, <script data-card-contents-for-ri="459" type="text/json">{"id":459,"name":"Information Science","url":"https://www.academia.edu/Documents/in/Information_Science?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="131903" href="https://www.academia.edu/Documents/in/Arithmetic">Arithmetic</a>, <script data-card-contents-for-ri="131903" type="text/json">{"id":131903,"name":"Arithmetic","url":"https://www.academia.edu/Documents/in/Arithmetic?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="151060" href="https://www.academia.edu/Documents/in/FFT">FFT</a><script data-card-contents-for-ri="151060" type="text/json">{"id":151060,"name":"FFT","url":"https://www.academia.edu/Documents/in/FFT?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=1074781]'), work: {"id":1074781,"title":"A super-efficient adaptable bit-reversal algorithm for multithreaded architectures","created_at":"2011-11-08T04:55:37.609-08:00","url":"https://www.academia.edu/1074781/A_super_efficient_adaptable_bit_reversal_algorithm_for_multithreaded_architectures?f_ri=223634","dom_id":"work_1074781","summary":null,"downloadable_attachments":[{"id":34504646,"asset_id":1074781,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":923324,"first_name":"Anne C.","last_name":"Elster","domain_name":"ntnu-no","page_name":"AnneCElster","display_name":"Anne C. Elster","profile_url":"https://ntnu-no.academia.edu/AnneCElster?f_ri=223634","photo":"https://0.academia-photos.com/923324/345235/7836938/s65_anne_c..elster.jpg"}],"research_interests":[{"id":433,"name":"Computer Architecture","url":"https://www.academia.edu/Documents/in/Computer_Architecture?f_ri=223634","nofollow":false},{"id":459,"name":"Information Science","url":"https://www.academia.edu/Documents/in/Information_Science?f_ri=223634","nofollow":false},{"id":131903,"name":"Arithmetic","url":"https://www.academia.edu/Documents/in/Arithmetic?f_ri=223634","nofollow":false},{"id":151060,"name":"FFT","url":"https://www.academia.edu/Documents/in/FFT?f_ri=223634","nofollow":false},{"id":161230,"name":"Look up Table","url":"https://www.academia.edu/Documents/in/Look_up_Table?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":568468,"name":"Parallel and Distributed Processing","url":"https://www.academia.edu/Documents/in/Parallel_and_Distributed_Processing?f_ri=223634"},{"id":588226,"name":"Fast Fourier Transform","url":"https://www.academia.edu/Documents/in/Fast_Fourier_Transform?f_ri=223634"},{"id":1124397,"name":"Multi-threading","url":"https://www.academia.edu/Documents/in/Multi-threading?f_ri=223634"},{"id":1274564,"name":"Fast Fourier Transforms","url":"https://www.academia.edu/Documents/in/Fast_Fourier_Transforms?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_77913433" data-work_id="77913433" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/77913433/A_Faster_and_Simpler_2_Approximation_Algorithm_for_Block_Sorting">A Faster and Simpler 2-Approximation Algorithm for Block Sorting</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/77913433" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="611de17e0fffc23039b82dff3b6fbca4" rel="nofollow" data-download="{"attachment_id":85145585,"asset_id":77913433,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/85145585/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="222206227" href="https://independent.academia.edu/LindaMorales60">Linda Morales</a><script data-card-contents-for-user="222206227" type="text/json">{"id":222206227,"first_name":"Linda","last_name":"Morales","domain_name":"independent","page_name":"LindaMorales60","display_name":"Linda Morales","profile_url":"https://independent.academia.edu/LindaMorales60?f_ri=223634","photo":"https://0.academia-photos.com/222206227/79864479/68435500/s65_linda.morales.png"}</script></span></span></li><li class="js-paper-rank-work_77913433 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="77913433"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 77913433, container: ".js-paper-rank-work_77913433", }); });</script></li><li class="js-percentile-work_77913433 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 77913433; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_77913433"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_77913433 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="77913433"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 77913433; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=77913433]").text(description); $(".js-view-count-work_77913433").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_77913433").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="77913433"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="7973" href="https://www.academia.edu/Documents/in/Approximation_Algorithms">Approximation Algorithms</a>, <script data-card-contents-for-ri="7973" type="text/json">{"id":7973,"name":"Approximation Algorithms","url":"https://www.academia.edu/Documents/in/Approximation_Algorithms?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="26817" href="https://www.academia.edu/Documents/in/Algorithm">Algorithm</a>, <script data-card-contents-for-ri="26817" type="text/json">{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="32702" href="https://www.academia.edu/Documents/in/Design_and_Analysis_of_Algorithms">Design and Analysis of Algorithms</a><script data-card-contents-for-ri="32702" type="text/json">{"id":32702,"name":"Design and Analysis of Algorithms","url":"https://www.academia.edu/Documents/in/Design_and_Analysis_of_Algorithms?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=77913433]'), work: {"id":77913433,"title":"A Faster and Simpler 2-Approximation Algorithm for Block Sorting","created_at":"2022-04-28T20:37:55.275-07:00","url":"https://www.academia.edu/77913433/A_Faster_and_Simpler_2_Approximation_Algorithm_for_Block_Sorting?f_ri=223634","dom_id":"work_77913433","summary":null,"downloadable_attachments":[{"id":85145585,"asset_id":77913433,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":222206227,"first_name":"Linda","last_name":"Morales","domain_name":"independent","page_name":"LindaMorales60","display_name":"Linda Morales","profile_url":"https://independent.academia.edu/LindaMorales60?f_ri=223634","photo":"https://0.academia-photos.com/222206227/79864479/68435500/s65_linda.morales.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false},{"id":7973,"name":"Approximation Algorithms","url":"https://www.academia.edu/Documents/in/Approximation_Algorithms?f_ri=223634","nofollow":false},{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm?f_ri=223634","nofollow":false},{"id":32702,"name":"Design and Analysis of Algorithms","url":"https://www.academia.edu/Documents/in/Design_and_Analysis_of_Algorithms?f_ri=223634","nofollow":false},{"id":116302,"name":"APPROXIMATION ALGORITHM","url":"https://www.academia.edu/Documents/in/APPROXIMATION_ALGORITHM?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":265584,"name":"Optical Character Recognition","url":"https://www.academia.edu/Documents/in/Optical_Character_Recognition?f_ri=223634"},{"id":559962,"name":"Approximate Algorithm","url":"https://www.academia.edu/Documents/in/Approximate_Algorithm?f_ri=223634"},{"id":585882,"name":"Sorting Algorithm","url":"https://www.academia.edu/Documents/in/Sorting_Algorithm?f_ri=223634"},{"id":1030194,"name":"Springer","url":"https://www.academia.edu/Documents/in/Springer?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_7714659" data-work_id="7714659" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/7714659/An%C3%A1lise_dos_m%C3%A9todos_de_ordena%C3%A7%C3%A3o">Análise dos métodos de ordenação</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/7714659" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="55fd4ec1db8253ea02f26c0c3d1a1d28" rel="nofollow" data-download="{"attachment_id":34241180,"asset_id":7714659,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/34241180/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="14110499" href="https://uesb.academia.edu/DavidBitencourt">David Bitencourt</a><script data-card-contents-for-user="14110499" type="text/json">{"id":14110499,"first_name":"David","last_name":"Bitencourt","domain_name":"uesb","page_name":"DavidBitencourt","display_name":"David Bitencourt","profile_url":"https://uesb.academia.edu/DavidBitencourt?f_ri=223634","photo":"https://0.academia-photos.com/14110499/8624709/9633110/s65_david.bitencourt.jpg_oh_a205271a5c70ae34f148efab184529fd_oe_55e3750c___gda___1440418737_e33afb3d345b26303d281ffac79d391b"}</script></span></span></li><li class="js-paper-rank-work_7714659 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="7714659"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 7714659, container: ".js-paper-rank-work_7714659", }); });</script></li><li class="js-percentile-work_7714659 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 7714659; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_7714659"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_7714659 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="7714659"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 7714659; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=7714659]").text(description); $(".js-view-count-work_7714659").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_7714659").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="7714659"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="54344" href="https://www.academia.edu/Documents/in/Methods">Methods</a>, <script data-card-contents-for-ri="54344" type="text/json">{"id":54344,"name":"Methods","url":"https://www.academia.edu/Documents/in/Methods?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="152114" href="https://www.academia.edu/Documents/in/Bubble">Bubble</a>, <script data-card-contents-for-ri="152114" type="text/json">{"id":152114,"name":"Bubble","url":"https://www.academia.edu/Documents/in/Bubble?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a>, <script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="304264" href="https://www.academia.edu/Documents/in/Quick">Quick</a><script data-card-contents-for-ri="304264" type="text/json">{"id":304264,"name":"Quick","url":"https://www.academia.edu/Documents/in/Quick?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=7714659]'), work: {"id":7714659,"title":"Análise dos métodos de ordenação","created_at":"2014-07-19T06:47:28.995-07:00","url":"https://www.academia.edu/7714659/An%C3%A1lise_dos_m%C3%A9todos_de_ordena%C3%A7%C3%A3o?f_ri=223634","dom_id":"work_7714659","summary":null,"downloadable_attachments":[{"id":34241180,"asset_id":7714659,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":14110499,"first_name":"David","last_name":"Bitencourt","domain_name":"uesb","page_name":"DavidBitencourt","display_name":"David Bitencourt","profile_url":"https://uesb.academia.edu/DavidBitencourt?f_ri=223634","photo":"https://0.academia-photos.com/14110499/8624709/9633110/s65_david.bitencourt.jpg_oh_a205271a5c70ae34f148efab184529fd_oe_55e3750c___gda___1440418737_e33afb3d345b26303d281ffac79d391b"}],"research_interests":[{"id":54344,"name":"Methods","url":"https://www.academia.edu/Documents/in/Methods?f_ri=223634","nofollow":false},{"id":152114,"name":"Bubble","url":"https://www.academia.edu/Documents/in/Bubble?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false},{"id":304264,"name":"Quick","url":"https://www.academia.edu/Documents/in/Quick?f_ri=223634","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_50125185" data-work_id="50125185" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/50125185/Transparency_and_Anti_Aliasing_Techniques_for_Real_Time_Rendering">Transparency and Anti-Aliasing Techniques for Real-Time Rendering</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/50125185" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d397aa9154c11f5e8239945d1e8b6cc6" rel="nofollow" data-download="{"attachment_id":68228106,"asset_id":50125185,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/68228106/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="38031359" href="https://independent.academia.edu/JoaoComba">Joao Comba</a><script data-card-contents-for-user="38031359" type="text/json">{"id":38031359,"first_name":"Joao","last_name":"Comba","domain_name":"independent","page_name":"JoaoComba","display_name":"Joao Comba","profile_url":"https://independent.academia.edu/JoaoComba?f_ri=223634","photo":"https://0.academia-photos.com/38031359/56384877/44585681/s65_joao.comba.jpeg"}</script></span></span></li><li class="js-paper-rank-work_50125185 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="50125185"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 50125185, container: ".js-paper-rank-work_50125185", }); });</script></li><li class="js-percentile-work_50125185 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 50125185; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_50125185"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_50125185 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="50125185"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 50125185; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=50125185]").text(description); $(".js-view-count-work_50125185").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_50125185").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="50125185"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="54418" href="https://www.academia.edu/Documents/in/Geometry">Geometry</a>, <script data-card-contents-for-ri="54418" type="text/json">{"id":54418,"name":"Geometry","url":"https://www.academia.edu/Documents/in/Geometry?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="59537" href="https://www.academia.edu/Documents/in/Transparency">Transparency</a>, <script data-card-contents-for-ri="59537" type="text/json">{"id":59537,"name":"Transparency","url":"https://www.academia.edu/Documents/in/Transparency?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a>, <script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="229390" href="https://www.academia.edu/Documents/in/Real_Time">Real Time</a><script data-card-contents-for-ri="229390" type="text/json">{"id":229390,"name":"Real Time","url":"https://www.academia.edu/Documents/in/Real_Time?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=50125185]'), work: {"id":50125185,"title":"Transparency and Anti-Aliasing Techniques for Real-Time Rendering","created_at":"2021-07-21T03:47:29.206-07:00","url":"https://www.academia.edu/50125185/Transparency_and_Anti_Aliasing_Techniques_for_Real_Time_Rendering?f_ri=223634","dom_id":"work_50125185","summary":null,"downloadable_attachments":[{"id":68228106,"asset_id":50125185,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":38031359,"first_name":"Joao","last_name":"Comba","domain_name":"independent","page_name":"JoaoComba","display_name":"Joao Comba","profile_url":"https://independent.academia.edu/JoaoComba?f_ri=223634","photo":"https://0.academia-photos.com/38031359/56384877/44585681/s65_joao.comba.jpeg"}],"research_interests":[{"id":54418,"name":"Geometry","url":"https://www.academia.edu/Documents/in/Geometry?f_ri=223634","nofollow":false},{"id":59537,"name":"Transparency","url":"https://www.academia.edu/Documents/in/Transparency?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false},{"id":229390,"name":"Real Time","url":"https://www.academia.edu/Documents/in/Real_Time?f_ri=223634","nofollow":false},{"id":3455089,"name":"image resolution","url":"https://www.academia.edu/Documents/in/image_resolution?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_48871779" data-work_id="48871779" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/48871779/DAVE_A_Dynamic_Algorithm_Visualization_Environment_for_Novice_Learners">DAVE: A Dynamic Algorithm Visualization Environment for Novice Learners</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/48871779" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1f84887f56cd1284f7b17ce6b61941f5" rel="nofollow" data-download="{"attachment_id":67282892,"asset_id":48871779,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/67282892/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="43110927" href="https://independent.academia.edu/EVrachnos">Evripides Vrachnos</a><script data-card-contents-for-user="43110927" type="text/json">{"id":43110927,"first_name":"Evripides","last_name":"Vrachnos","domain_name":"independent","page_name":"EVrachnos","display_name":"Evripides Vrachnos","profile_url":"https://independent.academia.edu/EVrachnos?f_ri=223634","photo":"https://0.academia-photos.com/43110927/12184785/13570412/s65_evripides.vrachnos.jpg"}</script></span></span></li><li class="js-paper-rank-work_48871779 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="48871779"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 48871779, container: ".js-paper-rank-work_48871779", }); });</script></li><li class="js-percentile-work_48871779 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 48871779; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_48871779"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_48871779 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="48871779"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 48871779; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=48871779]").text(description); $(".js-view-count-work_48871779").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_48871779").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="48871779"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="453" href="https://www.academia.edu/Documents/in/Object_Oriented_Programming">Object Oriented Programming</a>, <script data-card-contents-for-ri="453" type="text/json">{"id":453,"name":"Object Oriented Programming","url":"https://www.academia.edu/Documents/in/Object_Oriented_Programming?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1128" href="https://www.academia.edu/Documents/in/Computer_Science_Education">Computer Science Education</a>, <script data-card-contents-for-ri="1128" type="text/json">{"id":1128,"name":"Computer Science Education","url":"https://www.academia.edu/Documents/in/Computer_Science_Education?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1440" href="https://www.academia.edu/Documents/in/Visualization">Visualization</a>, <script data-card-contents-for-ri="1440" type="text/json">{"id":1440,"name":"Visualization","url":"https://www.academia.edu/Documents/in/Visualization?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1575" href="https://www.academia.edu/Documents/in/Animation">Animation</a><script data-card-contents-for-ri="1575" type="text/json">{"id":1575,"name":"Animation","url":"https://www.academia.edu/Documents/in/Animation?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=48871779]'), work: {"id":48871779,"title":"DAVE: A Dynamic Algorithm Visualization Environment for Novice Learners","created_at":"2021-05-10T09:34:20.298-07:00","url":"https://www.academia.edu/48871779/DAVE_A_Dynamic_Algorithm_Visualization_Environment_for_Novice_Learners?f_ri=223634","dom_id":"work_48871779","summary":null,"downloadable_attachments":[{"id":67282892,"asset_id":48871779,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":43110927,"first_name":"Evripides","last_name":"Vrachnos","domain_name":"independent","page_name":"EVrachnos","display_name":"Evripides Vrachnos","profile_url":"https://independent.academia.edu/EVrachnos?f_ri=223634","photo":"https://0.academia-photos.com/43110927/12184785/13570412/s65_evripides.vrachnos.jpg"}],"research_interests":[{"id":453,"name":"Object Oriented Programming","url":"https://www.academia.edu/Documents/in/Object_Oriented_Programming?f_ri=223634","nofollow":false},{"id":1128,"name":"Computer Science Education","url":"https://www.academia.edu/Documents/in/Computer_Science_Education?f_ri=223634","nofollow":false},{"id":1440,"name":"Visualization","url":"https://www.academia.edu/Documents/in/Visualization?f_ri=223634","nofollow":false},{"id":1575,"name":"Animation","url":"https://www.academia.edu/Documents/in/Animation?f_ri=223634","nofollow":false},{"id":10929,"name":"Dynamic programming","url":"https://www.academia.edu/Documents/in/Dynamic_programming?f_ri=223634"},{"id":47980,"name":"Data Visualization","url":"https://www.academia.edu/Documents/in/Data_Visualization?f_ri=223634"},{"id":48591,"name":"Data Visualisation","url":"https://www.academia.edu/Documents/in/Data_Visualisation?f_ri=223634"},{"id":53292,"name":"Programming","url":"https://www.academia.edu/Documents/in/Programming?f_ri=223634"},{"id":61307,"name":"Videoconference","url":"https://www.academia.edu/Documents/in/Videoconference?f_ri=223634"},{"id":116787,"name":"Algorithm Design","url":"https://www.academia.edu/Documents/in/Algorithm_Design?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_35922012 coauthored" data-work_id="35922012" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/35922012/Automatic_Sorting_in_Process_Industries_using_PLC">Automatic Sorting in Process Industries using PLC</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Sorting is an important thing in which any items or products can be differentiated based on their size, height and color. In order to sort items, we need to be able to compare them, i.e., to determine whether the object coming through the... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_35922012" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Sorting is an important thing in which any items or products can be differentiated based on their size, height and color. In order to sort items, we need to be able to compare them, i.e., to determine whether the object coming through the conveyor is smaller, greater, or equal to the respected height. Here we are going to do a simple object sorting system using the Programmable Logic Controller (PLC). The system consists of a conveyor model in which the sorting process takes place. The product will be coming through the conveyor system to the sensing part, based on the height of the object the product will be sorted through the conveyor system by using the Programmable Logic System (PLC).</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/35922012" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1f44dbb963ba1ab2e259d028a3a009b7" rel="nofollow" data-download="{"attachment_id":55803508,"asset_id":35922012,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/55803508/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="39769535" href="https://independent.academia.edu/GrdJournals">GRD JOURNALS</a><script data-card-contents-for-user="39769535" type="text/json">{"id":39769535,"first_name":"GRD","last_name":"JOURNALS","domain_name":"independent","page_name":"GrdJournals","display_name":"GRD JOURNALS","profile_url":"https://independent.academia.edu/GrdJournals?f_ri=223634","photo":"https://0.academia-photos.com/39769535/10920899/14235200/s65_grd.journals.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-35922012">+1</span><div class="hidden js-additional-users-35922012"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/KalaiselvanR">R. Kalaiselvan</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-35922012'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-35922012').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_35922012 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="35922012"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 35922012, container: ".js-paper-rank-work_35922012", }); });</script></li><li class="js-percentile-work_35922012 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 35922012; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_35922012"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_35922012 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="35922012"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 35922012; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=35922012]").text(description); $(".js-view-count-work_35922012").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_35922012").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="35922012"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="4735" href="https://www.academia.edu/Documents/in/Sensor">Sensor</a>, <script data-card-contents-for-ri="4735" type="text/json">{"id":4735,"name":"Sensor","url":"https://www.academia.edu/Documents/in/Sensor?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a>, <script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="241575" href="https://www.academia.edu/Documents/in/programmable_logic_controller_PLC_">programmable logic controller(PLC)</a>, <script data-card-contents-for-ri="241575" type="text/json">{"id":241575,"name":"programmable logic controller(PLC)","url":"https://www.academia.edu/Documents/in/programmable_logic_controller_PLC_?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="651044" href="https://www.academia.edu/Documents/in/Conveyor">Conveyor</a><script data-card-contents-for-ri="651044" type="text/json">{"id":651044,"name":"Conveyor","url":"https://www.academia.edu/Documents/in/Conveyor?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=35922012]'), work: {"id":35922012,"title":"Automatic Sorting in Process Industries using PLC","created_at":"2018-02-14T09:42:13.351-08:00","url":"https://www.academia.edu/35922012/Automatic_Sorting_in_Process_Industries_using_PLC?f_ri=223634","dom_id":"work_35922012","summary":"Sorting is an important thing in which any items or products can be differentiated based on their size, height and color. In order to sort items, we need to be able to compare them, i.e., to determine whether the object coming through the conveyor is smaller, greater, or equal to the respected height. Here we are going to do a simple object sorting system using the Programmable Logic Controller (PLC). The system consists of a conveyor model in which the sorting process takes place. The product will be coming through the conveyor system to the sensing part, based on the height of the object the product will be sorted through the conveyor system by using the Programmable Logic System (PLC).","downloadable_attachments":[{"id":55803508,"asset_id":35922012,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":39769535,"first_name":"GRD","last_name":"JOURNALS","domain_name":"independent","page_name":"GrdJournals","display_name":"GRD JOURNALS","profile_url":"https://independent.academia.edu/GrdJournals?f_ri=223634","photo":"https://0.academia-photos.com/39769535/10920899/14235200/s65_grd.journals.png"},{"id":77427665,"first_name":"R.","last_name":"Kalaiselvan","domain_name":"independent","page_name":"KalaiselvanR","display_name":"R. Kalaiselvan","profile_url":"https://independent.academia.edu/KalaiselvanR?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":4735,"name":"Sensor","url":"https://www.academia.edu/Documents/in/Sensor?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false},{"id":241575,"name":"programmable logic controller(PLC)","url":"https://www.academia.edu/Documents/in/programmable_logic_controller_PLC_?f_ri=223634","nofollow":false},{"id":651044,"name":"Conveyor","url":"https://www.academia.edu/Documents/in/Conveyor?f_ri=223634","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_74138666" data-work_id="74138666" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/74138666/Run_time_parallelization_and_scheduling_of_loops">Run-time parallelization and scheduling of loops</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/74138666" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="4ec5cb033c4a3d5b01b17e1d38abacd6" rel="nofollow" data-download="{"attachment_id":82397720,"asset_id":74138666,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/82397720/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="16938697" href="https://independent.academia.edu/JoelSaltz">Joel Saltz</a><script data-card-contents-for-user="16938697" type="text/json">{"id":16938697,"first_name":"Joel","last_name":"Saltz","domain_name":"independent","page_name":"JoelSaltz","display_name":"Joel Saltz","profile_url":"https://independent.academia.edu/JoelSaltz?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_74138666 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="74138666"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 74138666, container: ".js-paper-rank-work_74138666", }); });</script></li><li class="js-percentile-work_74138666 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 74138666; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_74138666"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_74138666 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="74138666"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 74138666; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=74138666]").text(description); $(".js-view-count-work_74138666").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_74138666").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="74138666"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">20</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="440" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="457" href="https://www.academia.edu/Documents/in/Compilers">Compilers</a>, <script data-card-contents-for-ri="457" type="text/json">{"id":457,"name":"Compilers","url":"https://www.academia.edu/Documents/in/Compilers?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3069" href="https://www.academia.edu/Documents/in/Parallel_Programming">Parallel Programming</a><script data-card-contents-for-ri="3069" type="text/json">{"id":3069,"name":"Parallel Programming","url":"https://www.academia.edu/Documents/in/Parallel_Programming?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=74138666]'), work: {"id":74138666,"title":"Run-time parallelization and scheduling of loops","created_at":"2022-03-20T08:11:07.402-07:00","url":"https://www.academia.edu/74138666/Run_time_parallelization_and_scheduling_of_loops?f_ri=223634","dom_id":"work_74138666","summary":null,"downloadable_attachments":[{"id":82397720,"asset_id":74138666,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":16938697,"first_name":"Joel","last_name":"Saltz","domain_name":"independent","page_name":"JoelSaltz","display_name":"Joel Saltz","profile_url":"https://independent.academia.edu/JoelSaltz?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false},{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=223634","nofollow":false},{"id":457,"name":"Compilers","url":"https://www.academia.edu/Documents/in/Compilers?f_ri=223634","nofollow":false},{"id":3069,"name":"Parallel Programming","url":"https://www.academia.edu/Documents/in/Parallel_Programming?f_ri=223634","nofollow":false},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling?f_ri=223634"},{"id":15759,"name":"Computer Hardware","url":"https://www.academia.edu/Documents/in/Computer_Hardware?f_ri=223634"},{"id":17167,"name":"Parallel Processing","url":"https://www.academia.edu/Documents/in/Parallel_Processing?f_ri=223634"},{"id":45676,"name":"Failure Analysis","url":"https://www.academia.edu/Documents/in/Failure_Analysis?f_ri=223634"},{"id":48326,"name":"Compiler","url":"https://www.academia.edu/Documents/in/Compiler?f_ri=223634"},{"id":49419,"name":"Problem Solving","url":"https://www.academia.edu/Documents/in/Problem_Solving?f_ri=223634"},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=223634"},{"id":97289,"name":"Algorithmics","url":"https://www.academia.edu/Documents/in/Algorithmics?f_ri=223634"},{"id":97733,"name":"Shared memory","url":"https://www.academia.edu/Documents/in/Shared_memory?f_ri=223634"},{"id":116313,"name":"Automatic Parallelization","url":"https://www.academia.edu/Documents/in/Automatic_Parallelization?f_ri=223634"},{"id":138293,"name":"Level Set","url":"https://www.academia.edu/Documents/in/Level_Set?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":532661,"name":"Dependence Analysis","url":"https://www.academia.edu/Documents/in/Dependence_Analysis?f_ri=223634"},{"id":691637,"name":"Parallelization","url":"https://www.academia.edu/Documents/in/Parallelization?f_ri=223634"},{"id":749302,"name":"Indexation","url":"https://www.academia.edu/Documents/in/Indexation?f_ri=223634"},{"id":989975,"name":"Computations","url":"https://www.academia.edu/Documents/in/Computations?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_27885039" data-work_id="27885039" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/27885039/Automatic_Sorting_Machine">Automatic Sorting Machine</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The Automatic Sorting Machine is used to sort different types of products or commodities based on the barcode provided on them. This gives a provision to reduce the manual effort and hence human error by replacing the conventional methods... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_27885039" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The Automatic Sorting Machine is used to sort different types of products or commodities based on the barcode provided on them. This gives a provision to reduce the manual effort and hence human error by replacing the conventional methods of sorting in areas involving hectic sorting. The system comes into play in airports and other industrial distribution centres where the products or commodities have to be sorted into batches in order to take them to their respective destination. The products are put on a conveyer system where they are scanned for the particular barcode provided on them. Depending on the barcode, they are placed on the respective carriers automatically where these carriers dispatch them to the corresponding destinations.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/27885039" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="2a883ab611480b03a922d20adc0025f9" rel="nofollow" data-download="{"attachment_id":48171517,"asset_id":27885039,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48171517/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="26380082" href="https://independent.academia.edu/journal4research">J4R - Journal for Research</a><script data-card-contents-for-user="26380082" type="text/json">{"id":26380082,"first_name":"J4R","last_name":"Journal for Research","domain_name":"independent","page_name":"journal4research","display_name":"J4R - Journal for Research","profile_url":"https://independent.academia.edu/journal4research?f_ri=223634","photo":"https://0.academia-photos.com/26380082/7301012/8213044/s65_j4r.journal4research.png"}</script></span></span></li><li class="js-paper-rank-work_27885039 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="27885039"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 27885039, container: ".js-paper-rank-work_27885039", }); });</script></li><li class="js-percentile-work_27885039 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 27885039; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_27885039"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_27885039 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="27885039"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 27885039; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=27885039]").text(description); $(".js-view-count-work_27885039").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_27885039").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="27885039"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="1185" href="https://www.academia.edu/Documents/in/Image_Processing">Image Processing</a>, <script data-card-contents-for-ri="1185" type="text/json">{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="66379" href="https://www.academia.edu/Documents/in/Automation">Automation</a>, <script data-card-contents-for-ri="66379" type="text/json">{"id":66379,"name":"Automation","url":"https://www.academia.edu/Documents/in/Automation?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="127270" href="https://www.academia.edu/Documents/in/Microcontroller">Microcontroller</a>, <script data-card-contents-for-ri="127270" type="text/json">{"id":127270,"name":"Microcontroller","url":"https://www.academia.edu/Documents/in/Microcontroller?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a><script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=27885039]'), work: {"id":27885039,"title":"Automatic Sorting Machine","created_at":"2016-08-19T03:53:18.960-07:00","url":"https://www.academia.edu/27885039/Automatic_Sorting_Machine?f_ri=223634","dom_id":"work_27885039","summary":"The Automatic Sorting Machine is used to sort different types of products or commodities based on the barcode provided on them. This gives a provision to reduce the manual effort and hence human error by replacing the conventional methods of sorting in areas involving hectic sorting. The system comes into play in airports and other industrial distribution centres where the products or commodities have to be sorted into batches in order to take them to their respective destination. The products are put on a conveyer system where they are scanned for the particular barcode provided on them. Depending on the barcode, they are placed on the respective carriers automatically where these carriers dispatch them to the corresponding destinations.","downloadable_attachments":[{"id":48171517,"asset_id":27885039,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":26380082,"first_name":"J4R","last_name":"Journal for Research","domain_name":"independent","page_name":"journal4research","display_name":"J4R - Journal for Research","profile_url":"https://independent.academia.edu/journal4research?f_ri=223634","photo":"https://0.academia-photos.com/26380082/7301012/8213044/s65_j4r.journal4research.png"}],"research_interests":[{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=223634","nofollow":false},{"id":66379,"name":"Automation","url":"https://www.academia.edu/Documents/in/Automation?f_ri=223634","nofollow":false},{"id":127270,"name":"Microcontroller","url":"https://www.academia.edu/Documents/in/Microcontroller?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false},{"id":781517,"name":"Barcode","url":"https://www.academia.edu/Documents/in/Barcode?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_23484964" data-work_id="23484964" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/23484964/Hybrid_Sorting_Method">Hybrid Sorting Method</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest">A Study of Comparison Merge Sort Algorithm and Non-Comparison Counting Sort Algorithm in order to Combine them into a New, more Efficient Algorithm. Theoretical Model, Application in Color Quantization and Test Data.</div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/23484964" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="12a41908cf0e57371b0c2d922e398fb2" rel="nofollow" data-download="{"attachment_id":43921318,"asset_id":23484964,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/43921318/download_file?st=MTczMjgxMTk4Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="37780928" href="https://ntua.academia.edu/AngelosSpartalis">Angelos Spartalis</a><script data-card-contents-for-user="37780928" type="text/json">{"id":37780928,"first_name":"Angelos","last_name":"Spartalis","domain_name":"ntua","page_name":"AngelosSpartalis","display_name":"Angelos Spartalis","profile_url":"https://ntua.academia.edu/AngelosSpartalis?f_ri=223634","photo":"https://0.academia-photos.com/37780928/12016346/13387270/s65_angelos.spartalis.jpg"}</script></span></span></li><li class="js-paper-rank-work_23484964 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="23484964"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 23484964, container: ".js-paper-rank-work_23484964", }); });</script></li><li class="js-percentile-work_23484964 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 23484964; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_23484964"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_23484964 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="23484964"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 23484964; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=23484964]").text(description); $(".js-view-count-work_23484964").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_23484964").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="23484964"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="300" href="https://www.academia.edu/Documents/in/Mathematics">Mathematics</a>, <script data-card-contents-for-ri="300" type="text/json">{"id":300,"name":"Mathematics","url":"https://www.academia.edu/Documents/in/Mathematics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1185" href="https://www.academia.edu/Documents/in/Image_Processing">Image Processing</a>, <script data-card-contents-for-ri="1185" type="text/json">{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="9351" href="https://www.academia.edu/Documents/in/Image_Analysis">Image Analysis</a><script data-card-contents-for-ri="9351" type="text/json">{"id":9351,"name":"Image Analysis","url":"https://www.academia.edu/Documents/in/Image_Analysis?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=23484964]'), work: {"id":23484964,"title":"Hybrid Sorting Method","created_at":"2016-03-20T07:47:55.946-07:00","url":"https://www.academia.edu/23484964/Hybrid_Sorting_Method?f_ri=223634","dom_id":"work_23484964","summary":"A Study of Comparison Merge Sort Algorithm and Non-Comparison Counting Sort Algorithm in order to Combine them into a New, more Efficient Algorithm. Theoretical Model, Application in Color Quantization and Test Data.","downloadable_attachments":[{"id":43921318,"asset_id":23484964,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":37780928,"first_name":"Angelos","last_name":"Spartalis","domain_name":"ntua","page_name":"AngelosSpartalis","display_name":"Angelos Spartalis","profile_url":"https://ntua.academia.edu/AngelosSpartalis?f_ri=223634","photo":"https://0.academia-photos.com/37780928/12016346/13387270/s65_angelos.spartalis.jpg"}],"research_interests":[{"id":300,"name":"Mathematics","url":"https://www.academia.edu/Documents/in/Mathematics?f_ri=223634","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false},{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=223634","nofollow":false},{"id":9351,"name":"Image Analysis","url":"https://www.academia.edu/Documents/in/Image_Analysis?f_ri=223634","nofollow":false},{"id":35938,"name":"Digital Image Processing","url":"https://www.academia.edu/Documents/in/Digital_Image_Processing?f_ri=223634"},{"id":75582,"name":"Quantization","url":"https://www.academia.edu/Documents/in/Quantization?f_ri=223634"},{"id":76714,"name":"Color","url":"https://www.academia.edu/Documents/in/Color?f_ri=223634"},{"id":82771,"name":"Sorting Algorithms","url":"https://www.academia.edu/Documents/in/Sorting_Algorithms?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":585882,"name":"Sorting Algorithm","url":"https://www.academia.edu/Documents/in/Sorting_Algorithm?f_ri=223634"},{"id":1225536,"name":"Analaysis of Algorithem Sorting Algo of merge","url":"https://www.academia.edu/Documents/in/Analaysis_of_Algorithem_Sorting_Algo_of_merge?f_ri=223634"},{"id":1386908,"name":"Counting Sort","url":"https://www.academia.edu/Documents/in/Counting_Sort?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_41348991" data-work_id="41348991" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/41348991/Bucket_Sort_Algorithm_Implementation_in_Java">Bucket Sort Algorithm Implementation in Java</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest">This paper illustrates the bucket sort algorithm using Java</div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/41348991" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="9b346af2ecae786c7ffbb629e4e324ce" rel="nofollow" data-download="{"attachment_id":61551125,"asset_id":41348991,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/61551125/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3089182" href="https://bircham.academia.edu/JadMatta">Jad Matta</a><script data-card-contents-for-user="3089182" type="text/json">{"id":3089182,"first_name":"Jad","last_name":"Matta","domain_name":"bircham","page_name":"JadMatta","display_name":"Jad Matta","profile_url":"https://bircham.academia.edu/JadMatta?f_ri=223634","photo":"https://0.academia-photos.com/3089182/1014968/33526119/s65_jad.matta.jpg"}</script></span></span></li><li class="js-paper-rank-work_41348991 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="41348991"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 41348991, container: ".js-paper-rank-work_41348991", }); });</script></li><li class="js-percentile-work_41348991 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 41348991; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_41348991"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_41348991 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="41348991"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 41348991; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=41348991]").text(description); $(".js-view-count-work_41348991").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_41348991").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="41348991"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="168640" href="https://www.academia.edu/Documents/in/Analysis_of_Algorithms">Analysis of Algorithms</a>, <script data-card-contents-for-ri="168640" type="text/json">{"id":168640,"name":"Analysis of Algorithms","url":"https://www.academia.edu/Documents/in/Analysis_of_Algorithms?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a>, <script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="585882" href="https://www.academia.edu/Documents/in/Sorting_Algorithm">Sorting Algorithm</a><script data-card-contents-for-ri="585882" type="text/json">{"id":585882,"name":"Sorting Algorithm","url":"https://www.academia.edu/Documents/in/Sorting_Algorithm?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=41348991]'), work: {"id":41348991,"title":"Bucket Sort Algorithm Implementation in Java","created_at":"2019-12-18T07:14:54.060-08:00","url":"https://www.academia.edu/41348991/Bucket_Sort_Algorithm_Implementation_in_Java?f_ri=223634","dom_id":"work_41348991","summary":"This paper illustrates the bucket sort algorithm using Java","downloadable_attachments":[{"id":61551125,"asset_id":41348991,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3089182,"first_name":"Jad","last_name":"Matta","domain_name":"bircham","page_name":"JadMatta","display_name":"Jad Matta","profile_url":"https://bircham.academia.edu/JadMatta?f_ri=223634","photo":"https://0.academia-photos.com/3089182/1014968/33526119/s65_jad.matta.jpg"}],"research_interests":[{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=223634","nofollow":false},{"id":168640,"name":"Analysis of Algorithms","url":"https://www.academia.edu/Documents/in/Analysis_of_Algorithms?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false},{"id":585882,"name":"Sorting Algorithm","url":"https://www.academia.edu/Documents/in/Sorting_Algorithm?f_ri=223634","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_77802957" data-work_id="77802957" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/77802957/Software_engineering_project_simulation_in_student_entry_phase_of_computer_scientists_to_be">Software engineering project simulation in student entry phase of computer scientists-to-be</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Many freshmen students of computer science are unaware of the requirements and job profiles of their future professional domain. To provide them with a deeper insight into the requirements of their future jobs at an early point of their... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_77802957" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Many freshmen students of computer science are unaware of the requirements and job profiles of their future professional domain. To provide them with a deeper insight into the requirements of their future jobs at an early point of their studies, we designed a software engineering simulation project that focuses on the main tasks a software engineer has to deal with in professional life. More precisely, this project focuses on the major software-technical, methodological and practical competencies every computer scientist-to-be must acquire. Thus, this introductory software engineering project serves as a kind of “kick off meeting” for freshmen students in computer science. It creates an initial insight into and understanding of the overall interrelation of the different tasks and skills that will be a crucial part both of their study process as well as of their future professional career.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/77802957" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="195600223" href="https://independent.academia.edu/ThurnerVeronika">Veronika Thurner</a><script data-card-contents-for-user="195600223" type="text/json">{"id":195600223,"first_name":"Veronika","last_name":"Thurner","domain_name":"independent","page_name":"ThurnerVeronika","display_name":"Veronika Thurner","profile_url":"https://independent.academia.edu/ThurnerVeronika?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_77802957 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="77802957"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 77802957, container: ".js-paper-rank-work_77802957", }); });</script></li><li class="js-percentile-work_77802957 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 77802957; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_77802957"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_77802957 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="77802957"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 77802957; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=77802957]").text(description); $(".js-view-count-work_77802957").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_77802957").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="77802957"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="59249" href="https://www.academia.edu/Documents/in/Computers">Computers</a><script data-card-contents-for-ri="59249" type="text/json">{"id":59249,"name":"Computers","url":"https://www.academia.edu/Documents/in/Computers?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=77802957]'), work: {"id":77802957,"title":"Software engineering project simulation in student entry phase of computer scientists-to-be","created_at":"2022-04-27T11:15:49.192-07:00","url":"https://www.academia.edu/77802957/Software_engineering_project_simulation_in_student_entry_phase_of_computer_scientists_to_be?f_ri=223634","dom_id":"work_77802957","summary":"Many freshmen students of computer science are unaware of the requirements and job profiles of their future professional domain. To provide them with a deeper insight into the requirements of their future jobs at an early point of their studies, we designed a software engineering simulation project that focuses on the main tasks a software engineer has to deal with in professional life. More precisely, this project focuses on the major software-technical, methodological and practical competencies every computer scientist-to-be must acquire. Thus, this introductory software engineering project serves as a kind of “kick off meeting” for freshmen students in computer science. It creates an initial insight into and understanding of the overall interrelation of the different tasks and skills that will be a crucial part both of their study process as well as of their future professional career.","downloadable_attachments":[],"ordered_authors":[{"id":195600223,"first_name":"Veronika","last_name":"Thurner","domain_name":"independent","page_name":"ThurnerVeronika","display_name":"Veronika Thurner","profile_url":"https://independent.academia.edu/ThurnerVeronika?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=223634","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=223634","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=223634","nofollow":false},{"id":59249,"name":"Computers","url":"https://www.academia.edu/Documents/in/Computers?f_ri=223634","nofollow":false},{"id":97345,"name":"Knowledge Engineering","url":"https://www.academia.edu/Documents/in/Knowledge_Engineering?f_ri=223634"},{"id":111436,"name":"IEEE","url":"https://www.academia.edu/Documents/in/IEEE?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_10371061" data-work_id="10371061" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/10371061/Macam_macam_sorting_array">Macam - macam sorting array</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest">Sorting pada pemrograman adalah proses mengurutkan data yang berada dalam suatu tempat penyimpanan, dengan urutan tertentu.<br />Dalam bab ini yang akan dibahas adalah internal sort yaitu data yang berada dalam array satu dimensi.</div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/10371061" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f98b5219d92b0a2e95cc7026736da1d8" rel="nofollow" data-download="{"attachment_id":36438048,"asset_id":10371061,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/36438048/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="9969987" href="https://universitasnegerimalang.academia.edu/AbieTama">Adysta Abitama A</a><script data-card-contents-for-user="9969987" type="text/json">{"id":9969987,"first_name":"Adysta","last_name":"Abitama A","domain_name":"universitasnegerimalang","page_name":"AbieTama","display_name":"Adysta Abitama A","profile_url":"https://universitasnegerimalang.academia.edu/AbieTama?f_ri=223634","photo":"https://0.academia-photos.com/9969987/4613819/12880130/s65_adysta.abitama_a.jpg"}</script></span></span></li><li class="js-paper-rank-work_10371061 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="10371061"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 10371061, container: ".js-paper-rank-work_10371061", }); });</script></li><li class="js-percentile-work_10371061 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 10371061; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_10371061"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_10371061 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="10371061"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 10371061; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=10371061]").text(description); $(".js-view-count-work_10371061").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_10371061").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="10371061"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="82771" href="https://www.academia.edu/Documents/in/Sorting_Algorithms">Sorting Algorithms</a>, <script data-card-contents-for-ri="82771" type="text/json">{"id":82771,"name":"Sorting Algorithms","url":"https://www.academia.edu/Documents/in/Sorting_Algorithms?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a>, <script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="242420" href="https://www.academia.edu/Documents/in/Presentation_Slides">Presentation Slides</a>, <script data-card-contents-for-ri="242420" type="text/json">{"id":242420,"name":"Presentation Slides","url":"https://www.academia.edu/Documents/in/Presentation_Slides?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="572120" href="https://www.academia.edu/Documents/in/Array">Array</a><script data-card-contents-for-ri="572120" type="text/json">{"id":572120,"name":"Array","url":"https://www.academia.edu/Documents/in/Array?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=10371061]'), work: {"id":10371061,"title":"Macam - macam sorting array","created_at":"2015-01-29T04:57:13.547-08:00","url":"https://www.academia.edu/10371061/Macam_macam_sorting_array?f_ri=223634","dom_id":"work_10371061","summary":"Sorting pada pemrograman adalah proses mengurutkan data yang berada dalam suatu tempat penyimpanan, dengan urutan tertentu.\nDalam bab ini yang akan dibahas adalah internal sort yaitu data yang berada dalam array satu dimensi.","downloadable_attachments":[{"id":36438048,"asset_id":10371061,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":9969987,"first_name":"Adysta","last_name":"Abitama A","domain_name":"universitasnegerimalang","page_name":"AbieTama","display_name":"Adysta Abitama A","profile_url":"https://universitasnegerimalang.academia.edu/AbieTama?f_ri=223634","photo":"https://0.academia-photos.com/9969987/4613819/12880130/s65_adysta.abitama_a.jpg"}],"research_interests":[{"id":82771,"name":"Sorting Algorithms","url":"https://www.academia.edu/Documents/in/Sorting_Algorithms?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false},{"id":242420,"name":"Presentation Slides","url":"https://www.academia.edu/Documents/in/Presentation_Slides?f_ri=223634","nofollow":false},{"id":572120,"name":"Array","url":"https://www.academia.edu/Documents/in/Array?f_ri=223634","nofollow":false},{"id":585882,"name":"Sorting Algorithm","url":"https://www.academia.edu/Documents/in/Sorting_Algorithm?f_ri=223634"},{"id":1218098,"name":"Bubble Sort","url":"https://www.academia.edu/Documents/in/Bubble_Sort?f_ri=223634"},{"id":1218104,"name":"Quick Sort","url":"https://www.academia.edu/Documents/in/Quick_Sort?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_8140944" data-work_id="8140944" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/8140944/Optimal_approximations_by_piecewise_smooth_functions_and_associated_variational_problems">Optimal approximations by piecewise smooth functions and associated variational problems</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/8140944" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1ad15e71c493229717068b7c99f3b9b6" rel="nofollow" data-download="{"attachment_id":48203757,"asset_id":8140944,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48203757/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="15857165" href="https://neu.academia.edu/JayantShah">Jayant Shah</a><script data-card-contents-for-user="15857165" type="text/json">{"id":15857165,"first_name":"Jayant","last_name":"Shah","domain_name":"neu","page_name":"JayantShah","display_name":"Jayant Shah","profile_url":"https://neu.academia.edu/JayantShah?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_8140944 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="8140944"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 8140944, container: ".js-paper-rank-work_8140944", }); });</script></li><li class="js-percentile-work_8140944 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 8140944; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_8140944"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_8140944 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="8140944"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 8140944; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=8140944]").text(description); $(".js-view-count-work_8140944").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_8140944").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="8140944"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="305" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="445" href="https://www.academia.edu/Documents/in/Computer_Graphics">Computer Graphics</a>, <script data-card-contents-for-ri="445" type="text/json">{"id":445,"name":"Computer Graphics","url":"https://www.academia.edu/Documents/in/Computer_Graphics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1185" href="https://www.academia.edu/Documents/in/Image_Processing">Image Processing</a>, <script data-card-contents-for-ri="1185" type="text/json">{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="19997" href="https://www.academia.edu/Documents/in/Pure_Mathematics">Pure Mathematics</a><script data-card-contents-for-ri="19997" type="text/json">{"id":19997,"name":"Pure Mathematics","url":"https://www.academia.edu/Documents/in/Pure_Mathematics?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=8140944]'), work: {"id":8140944,"title":"Optimal approximations by piecewise smooth functions and associated variational problems","created_at":"2014-08-30T23:38:23.581-07:00","url":"https://www.academia.edu/8140944/Optimal_approximations_by_piecewise_smooth_functions_and_associated_variational_problems?f_ri=223634","dom_id":"work_8140944","summary":null,"downloadable_attachments":[{"id":48203757,"asset_id":8140944,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":15857165,"first_name":"Jayant","last_name":"Shah","domain_name":"neu","page_name":"JayantShah","display_name":"Jayant Shah","profile_url":"https://neu.academia.edu/JayantShah?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=223634","nofollow":false},{"id":445,"name":"Computer Graphics","url":"https://www.academia.edu/Documents/in/Computer_Graphics?f_ri=223634","nofollow":false},{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=223634","nofollow":false},{"id":19997,"name":"Pure Mathematics","url":"https://www.academia.edu/Documents/in/Pure_Mathematics?f_ri=223634","nofollow":false},{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=223634"},{"id":54418,"name":"Geometry","url":"https://www.academia.edu/Documents/in/Geometry?f_ri=223634"},{"id":59692,"name":"Vision","url":"https://www.academia.edu/Documents/in/Vision?f_ri=223634"},{"id":75964,"name":"Boundaries","url":"https://www.academia.edu/Documents/in/Boundaries?f_ri=223634"},{"id":99514,"name":"Images","url":"https://www.academia.edu/Documents/in/Images?f_ri=223634"},{"id":128057,"name":"Light","url":"https://www.academia.edu/Documents/in/Light?f_ri=223634"},{"id":157607,"name":"Variational Methods","url":"https://www.academia.edu/Documents/in/Variational_Methods?f_ri=223634"},{"id":159978,"name":"Visibility","url":"https://www.academia.edu/Documents/in/Visibility?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":409626,"name":"Intensity","url":"https://www.academia.edu/Documents/in/Intensity?f_ri=223634"},{"id":504035,"name":"Three Dimensional","url":"https://www.academia.edu/Documents/in/Three_Dimensional?f_ri=223634"},{"id":765332,"name":"Transformations","url":"https://www.academia.edu/Documents/in/Transformations?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_31366579" data-work_id="31366579" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/31366579/A_sort_implementation_comparing_with_Bubble_sort_and_Selection_sort">A sort implementation comparing with Bubble sort and Selection sort</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Today implementation of sort leads to lower and easier order time. Our purpose in this article are trying to introduce an algorithm with lower cost of Bubble sort and nearly same as Selection sort. A way is in orderly inserting of... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_31366579" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Today implementation of sort leads to lower and easier order time. Our purpose in this article are trying to introduce an algorithm with lower cost of Bubble sort and nearly same as Selection sort. A way is in orderly inserting of elements in another array. Sort is an algorithm that arranges all elements of an array, orderly. This algorithm has sequential form. The order of Selection sort complexity is nearly least than Bubble sort.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/31366579" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bc9709d91e6c5f07cd8f8a09fdf1402b" rel="nofollow" data-download="{"attachment_id":61821972,"asset_id":31366579,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/61821972/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="59021127" href="https://independent.academia.edu/RaminEdjlal">Ramin Edjlal</a><script data-card-contents-for-user="59021127" type="text/json">{"id":59021127,"first_name":"Ramin","last_name":"Edjlal","domain_name":"independent","page_name":"RaminEdjlal","display_name":"Ramin Edjlal","profile_url":"https://independent.academia.edu/RaminEdjlal?f_ri=223634","photo":"https://0.academia-photos.com/59021127/16784849/17044423/s65_ramin.edjlal.jpg"}</script></span></span></li><li class="js-paper-rank-work_31366579 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="31366579"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 31366579, container: ".js-paper-rank-work_31366579", }); });</script></li><li class="js-percentile-work_31366579 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 31366579; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_31366579"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_31366579 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="31366579"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 31366579; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=31366579]").text(description); $(".js-view-count-work_31366579").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_31366579").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="31366579"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="1236" href="https://www.academia.edu/Documents/in/Art">Art</a>, <script data-card-contents-for-ri="1236" type="text/json">{"id":1236,"name":"Art","url":"https://www.academia.edu/Documents/in/Art?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3155" href="https://www.academia.edu/Documents/in/Complexity_Theory">Complexity Theory</a>, <script data-card-contents-for-ri="3155" type="text/json">{"id":3155,"name":"Complexity Theory","url":"https://www.academia.edu/Documents/in/Complexity_Theory?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="26817" href="https://www.academia.edu/Documents/in/Algorithm">Algorithm</a>, <script data-card-contents-for-ri="26817" type="text/json">{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="53292" href="https://www.academia.edu/Documents/in/Programming">Programming</a><script data-card-contents-for-ri="53292" type="text/json">{"id":53292,"name":"Programming","url":"https://www.academia.edu/Documents/in/Programming?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=31366579]'), work: {"id":31366579,"title":"A sort implementation comparing with Bubble sort and Selection sort","created_at":"2017-02-11T01:21:18.738-08:00","url":"https://www.academia.edu/31366579/A_sort_implementation_comparing_with_Bubble_sort_and_Selection_sort?f_ri=223634","dom_id":"work_31366579","summary":"Today implementation of sort leads to lower and easier order time. Our purpose in this article are trying to introduce an algorithm with lower cost of Bubble sort and nearly same as Selection sort. A way is in orderly inserting of elements in another array. Sort is an algorithm that arranges all elements of an array, orderly. This algorithm has sequential form. The order of Selection sort complexity is nearly least than Bubble sort.","downloadable_attachments":[{"id":61821972,"asset_id":31366579,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":59021127,"first_name":"Ramin","last_name":"Edjlal","domain_name":"independent","page_name":"RaminEdjlal","display_name":"Ramin Edjlal","profile_url":"https://independent.academia.edu/RaminEdjlal?f_ri=223634","photo":"https://0.academia-photos.com/59021127/16784849/17044423/s65_ramin.edjlal.jpg"}],"research_interests":[{"id":1236,"name":"Art","url":"https://www.academia.edu/Documents/in/Art?f_ri=223634","nofollow":false},{"id":3155,"name":"Complexity Theory","url":"https://www.academia.edu/Documents/in/Complexity_Theory?f_ri=223634","nofollow":false},{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm?f_ri=223634","nofollow":false},{"id":53292,"name":"Programming","url":"https://www.academia.edu/Documents/in/Programming?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":585882,"name":"Sorting Algorithm","url":"https://www.academia.edu/Documents/in/Sorting_Algorithm?f_ri=223634"},{"id":749302,"name":"Indexation","url":"https://www.academia.edu/Documents/in/Indexation?f_ri=223634"},{"id":1004301,"name":"SORT","url":"https://www.academia.edu/Documents/in/SORT?f_ri=223634"},{"id":1006047,"name":"Indexes","url":"https://www.academia.edu/Documents/in/Indexes?f_ri=223634"},{"id":1218098,"name":"Bubble Sort","url":"https://www.academia.edu/Documents/in/Bubble_Sort?f_ri=223634"},{"id":2176950,"name":"Selection Sort","url":"https://www.academia.edu/Documents/in/Selection_Sort?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_760913" data-work_id="760913" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/760913/Swarm_intelligence_from_natural_to_artificial_systems">Swarm intelligence: from natural to artificial systems</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/760913" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="50c3d6b0e58451daf8bd069d0c01a920" rel="nofollow" data-download="{"attachment_id":4418202,"asset_id":760913,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/4418202/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="14873" href="https://ulb.academia.edu/MarcoDorigo">Marco Dorigo</a><script data-card-contents-for-user="14873" type="text/json">{"id":14873,"first_name":"Marco","last_name":"Dorigo","domain_name":"ulb","page_name":"MarcoDorigo","display_name":"Marco Dorigo","profile_url":"https://ulb.academia.edu/MarcoDorigo?f_ri=223634","photo":"https://0.academia-photos.com/14873/80064/18212456/s65_marco.dorigo.jpg"}</script></span></span></li><li class="js-paper-rank-work_760913 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="760913"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 760913, container: ".js-paper-rank-work_760913", }); });</script></li><li class="js-percentile-work_760913 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 760913; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_760913"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_760913 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="760913"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 760913; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=760913]").text(description); $(".js-view-count-work_760913").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_760913").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="760913"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">18</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="37" href="https://www.academia.edu/Documents/in/Information_Systems">Information Systems</a>, <script data-card-contents-for-ri="37" type="text/json">{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="237" href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a>, <script data-card-contents-for-ri="237" type="text/json">{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="300" href="https://www.academia.edu/Documents/in/Mathematics">Mathematics</a>, <script data-card-contents-for-ri="300" type="text/json">{"id":300,"name":"Mathematics","url":"https://www.academia.edu/Documents/in/Mathematics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2507" href="https://www.academia.edu/Documents/in/Combinatorial_Optimization">Combinatorial Optimization</a><script data-card-contents-for-ri="2507" type="text/json">{"id":2507,"name":"Combinatorial Optimization","url":"https://www.academia.edu/Documents/in/Combinatorial_Optimization?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=760913]'), work: {"id":760913,"title":"Swarm intelligence: from natural to artificial systems","created_at":"2011-07-19T18:05:42.414-07:00","url":"https://www.academia.edu/760913/Swarm_intelligence_from_natural_to_artificial_systems?f_ri=223634","dom_id":"work_760913","summary":null,"downloadable_attachments":[{"id":4418202,"asset_id":760913,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":14873,"first_name":"Marco","last_name":"Dorigo","domain_name":"ulb","page_name":"MarcoDorigo","display_name":"Marco Dorigo","profile_url":"https://ulb.academia.edu/MarcoDorigo?f_ri=223634","photo":"https://0.academia-photos.com/14873/80064/18212456/s65_marco.dorigo.jpg"}],"research_interests":[{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=223634","nofollow":false},{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=223634","nofollow":false},{"id":300,"name":"Mathematics","url":"https://www.academia.edu/Documents/in/Mathematics?f_ri=223634","nofollow":false},{"id":2507,"name":"Combinatorial Optimization","url":"https://www.academia.edu/Documents/in/Combinatorial_Optimization?f_ri=223634","nofollow":false},{"id":4233,"name":"Computational Biology","url":"https://www.academia.edu/Documents/in/Computational_Biology?f_ri=223634"},{"id":5395,"name":"Swarm Intelligence","url":"https://www.academia.edu/Documents/in/Swarm_Intelligence?f_ri=223634"},{"id":6420,"name":"Ant Colony Optimization","url":"https://www.academia.edu/Documents/in/Ant_Colony_Optimization?f_ri=223634"},{"id":7710,"name":"Biology","url":"https://www.academia.edu/Documents/in/Biology?f_ri=223634"},{"id":25896,"name":"Particle Swarm Optimization","url":"https://www.academia.edu/Documents/in/Particle_Swarm_Optimization?f_ri=223634"},{"id":47884,"name":"Biological Sciences","url":"https://www.academia.edu/Documents/in/Biological_Sciences?f_ri=223634"},{"id":93882,"name":"Robot kinematics","url":"https://www.academia.edu/Documents/in/Robot_kinematics?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":279495,"name":"Robustness","url":"https://www.academia.edu/Documents/in/Robustness?f_ri=223634"},{"id":345971,"name":"Design optimization","url":"https://www.academia.edu/Documents/in/Design_optimization?f_ri=223634"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=223634"},{"id":2431149,"name":"Biologically Inspired Algorithm","url":"https://www.academia.edu/Documents/in/Biologically_Inspired_Algorithm?f_ri=223634"},{"id":2431150,"name":"Artificial Swarm Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Swarm_Intelligence?f_ri=223634"},{"id":2431151,"name":"Metaheuristic Technique","url":"https://www.academia.edu/Documents/in/Metaheuristic_Technique?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_66525609" data-work_id="66525609" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/66525609/The_Lighthouse_Effect_and_Beyond">The Lighthouse Effect and Beyond</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/66525609" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a3ed074a696479948de024f39b7da67f" rel="nofollow" data-download="{"attachment_id":77682767,"asset_id":66525609,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/77682767/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="36986855" href="https://unito.academia.edu/PietroGaribaldi">Pietro Garibaldi</a><script data-card-contents-for-user="36986855" type="text/json">{"id":36986855,"first_name":"Pietro","last_name":"Garibaldi","domain_name":"unito","page_name":"PietroGaribaldi","display_name":"Pietro Garibaldi","profile_url":"https://unito.academia.edu/PietroGaribaldi?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_66525609 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="66525609"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 66525609, container: ".js-paper-rank-work_66525609", }); });</script></li><li class="js-percentile-work_66525609 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 66525609; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_66525609"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_66525609 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="66525609"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 66525609; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=66525609]").text(description); $(".js-view-count-work_66525609").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_66525609").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="66525609"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="724" href="https://www.academia.edu/Documents/in/Economics">Economics</a>, <script data-card-contents-for-ri="724" type="text/json">{"id":724,"name":"Economics","url":"https://www.academia.edu/Documents/in/Economics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="6208" href="https://www.academia.edu/Documents/in/Economic_Theory">Economic Theory</a>, <script data-card-contents-for-ri="6208" type="text/json">{"id":6208,"name":"Economic Theory","url":"https://www.academia.edu/Documents/in/Economic_Theory?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="27659" href="https://www.academia.edu/Documents/in/Applied_Economics">Applied Economics</a>, <script data-card-contents-for-ri="27659" type="text/json">{"id":27659,"name":"Applied Economics","url":"https://www.academia.edu/Documents/in/Applied_Economics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="73757" href="https://www.academia.edu/Documents/in/Informal_Sector">Informal Sector</a><script data-card-contents-for-ri="73757" type="text/json">{"id":73757,"name":"Informal Sector","url":"https://www.academia.edu/Documents/in/Informal_Sector?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=66525609]'), work: {"id":66525609,"title":"The Lighthouse Effect and Beyond","created_at":"2021-12-30T02:22:09.221-08:00","url":"https://www.academia.edu/66525609/The_Lighthouse_Effect_and_Beyond?f_ri=223634","dom_id":"work_66525609","summary":null,"downloadable_attachments":[{"id":77682767,"asset_id":66525609,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":36986855,"first_name":"Pietro","last_name":"Garibaldi","domain_name":"unito","page_name":"PietroGaribaldi","display_name":"Pietro Garibaldi","profile_url":"https://unito.academia.edu/PietroGaribaldi?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":724,"name":"Economics","url":"https://www.academia.edu/Documents/in/Economics?f_ri=223634","nofollow":false},{"id":6208,"name":"Economic Theory","url":"https://www.academia.edu/Documents/in/Economic_Theory?f_ri=223634","nofollow":false},{"id":27659,"name":"Applied Economics","url":"https://www.academia.edu/Documents/in/Applied_Economics?f_ri=223634","nofollow":false},{"id":73757,"name":"Informal Sector","url":"https://www.academia.edu/Documents/in/Informal_Sector?f_ri=223634","nofollow":false},{"id":148386,"name":"Minimum Wage","url":"https://www.academia.edu/Documents/in/Minimum_Wage?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":1778889,"name":"Wage Setting","url":"https://www.academia.edu/Documents/in/Wage_Setting?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_23525911" data-work_id="23525911" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/23525911/A_fast_two_dimensional_median_filtering_algorithm">A fast two-dimensional median filtering algorithm</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">We present a fast algorithm for two-dimensional median filtering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_23525911" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">We present a fast algorithm for two-dimensional median filtering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m × n, the computer time required is 0(n).</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/23525911" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bff7afeff9177fe27a01821b0c3004d4" rel="nofollow" data-download="{"attachment_id":43960877,"asset_id":23525911,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/43960877/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="18216249" href="https://sjusd.academia.edu/ThomasHuang">Thomas Huang</a><script data-card-contents-for-user="18216249" type="text/json">{"id":18216249,"first_name":"Thomas","last_name":"Huang","domain_name":"sjusd","page_name":"ThomasHuang","display_name":"Thomas Huang","profile_url":"https://sjusd.academia.edu/ThomasHuang?f_ri=223634","photo":"https://0.academia-photos.com/18216249/5095723/5841850/s65_thomas.huang.jpg_oh_48e5aa1ab699f4835ef79c62994db209_oe_54c7caac___gda___1425545411_a5efce904b5dff188b8017e0a532c552"}</script></span></span></li><li class="js-paper-rank-work_23525911 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="23525911"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 23525911, container: ".js-paper-rank-work_23525911", }); });</script></li><li class="js-percentile-work_23525911 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 23525911; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_23525911"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_23525911 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="23525911"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 23525911; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=23525911]").text(description); $(".js-view-count-work_23525911").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_23525911").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="23525911"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="1185" href="https://www.academia.edu/Documents/in/Image_Processing">Image Processing</a>, <script data-card-contents-for-ri="1185" type="text/json">{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="36835" href="https://www.academia.edu/Documents/in/Speech_Processing">Speech Processing</a>, <script data-card-contents-for-ri="36835" type="text/json">{"id":36835,"name":"Speech Processing","url":"https://www.academia.edu/Documents/in/Speech_Processing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="96798" href="https://www.academia.edu/Documents/in/Noise_reduction">Noise reduction</a>, <script data-card-contents-for-ri="96798" type="text/json">{"id":96798,"name":"Noise reduction","url":"https://www.academia.edu/Documents/in/Noise_reduction?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="155196" href="https://www.academia.edu/Documents/in/Median_Filter">Median Filter</a><script data-card-contents-for-ri="155196" type="text/json">{"id":155196,"name":"Median Filter","url":"https://www.academia.edu/Documents/in/Median_Filter?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=23525911]'), work: {"id":23525911,"title":"A fast two-dimensional median filtering algorithm","created_at":"2016-03-21T12:57:57.049-07:00","url":"https://www.academia.edu/23525911/A_fast_two_dimensional_median_filtering_algorithm?f_ri=223634","dom_id":"work_23525911","summary":"We present a fast algorithm for two-dimensional median filtering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m × n, the computer time required is 0(n).","downloadable_attachments":[{"id":43960877,"asset_id":23525911,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":18216249,"first_name":"Thomas","last_name":"Huang","domain_name":"sjusd","page_name":"ThomasHuang","display_name":"Thomas Huang","profile_url":"https://sjusd.academia.edu/ThomasHuang?f_ri=223634","photo":"https://0.academia-photos.com/18216249/5095723/5841850/s65_thomas.huang.jpg_oh_48e5aa1ab699f4835ef79c62994db209_oe_54c7caac___gda___1425545411_a5efce904b5dff188b8017e0a532c552"}],"research_interests":[{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=223634","nofollow":false},{"id":36835,"name":"Speech Processing","url":"https://www.academia.edu/Documents/in/Speech_Processing?f_ri=223634","nofollow":false},{"id":96798,"name":"Noise reduction","url":"https://www.academia.edu/Documents/in/Noise_reduction?f_ri=223634","nofollow":false},{"id":155196,"name":"Median Filter","url":"https://www.academia.edu/Documents/in/Median_Filter?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":236290,"name":"Tail","url":"https://www.academia.edu/Documents/in/Tail?f_ri=223634"},{"id":1789210,"name":"Histograms","url":"https://www.academia.edu/Documents/in/Histograms?f_ri=223634"},{"id":1957725,"name":"Fast Algorithm","url":"https://www.academia.edu/Documents/in/Fast_Algorithm?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3656275" data-work_id="3656275" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3656275/How_to_measure_single_name_credit_risk_concentrations">How to measure single-name credit risk concentrations</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Credit risk concentration is one of the leading topics in modern finance, as the bank regulation has made increasing use of external and internal credit ratings. Concentration risk in credit portfolios comes into being through an uneven... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_3656275" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Credit risk concentration is one of the leading topics in modern finance, as the bank regulation has made increasing use of external and internal credit ratings. Concentration risk in credit portfolios comes into being through an uneven distribution of bank loans to individual borrowers (single-name concentration) or in a hierarchical dimension such as in industry and services sectors and geographical regions (sectorial concentration).To measure single-name concentration risk the literature proposes specific concentration indexes such as the Herfindahl–Hirschman index, the Gini index or more general approaches to calculate the appropriate economic capital needed to cover the risk arising from the potential default of large borrowers.However, in our opinion, the Gini index and the Herfindahl–Hirschman index can be improved taking into account methodological and theoretical issues which are explained in this paper.We propose a new index to measure single-name credit concentration risk and we prove the properties of our contribution.Furthermore, considering the guidelines of Basel II, we describe how our index works on real financial data. Finally, we compare our index with the common procedures proposed in the literature on the basis of simulated and real data.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3656275" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="135f4f264a1155c07c82729bdc3ac5ef" rel="nofollow" data-download="{"attachment_id":50191361,"asset_id":3656275,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50191361/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4439457" href="https://unipv.academia.edu/SilviaFigini">Silvia Figini</a><script data-card-contents-for-user="4439457" type="text/json">{"id":4439457,"first_name":"Silvia","last_name":"Figini","domain_name":"unipv","page_name":"SilviaFigini","display_name":"Silvia Figini","profile_url":"https://unipv.academia.edu/SilviaFigini?f_ri=223634","photo":"https://0.academia-photos.com/4439457/1811780/2158744/s65_silvia.figini.jpg"}</script></span></span></li><li class="js-paper-rank-work_3656275 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3656275"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3656275, container: ".js-paper-rank-work_3656275", }); });</script></li><li class="js-percentile-work_3656275 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3656275; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3656275"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3656275 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3656275"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3656275; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3656275]").text(description); $(".js-view-count-work_3656275").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3656275").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3656275"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">28</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="47" href="https://www.academia.edu/Documents/in/Finance">Finance</a>, <script data-card-contents-for-ri="47" type="text/json">{"id":47,"name":"Finance","url":"https://www.academia.edu/Documents/in/Finance?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2009" href="https://www.academia.edu/Documents/in/Data_Mining">Data Mining</a>, <script data-card-contents-for-ri="2009" type="text/json">{"id":2009,"name":"Data Mining","url":"https://www.academia.edu/Documents/in/Data_Mining?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="4205" href="https://www.academia.edu/Documents/in/Data_Analysis">Data Analysis</a>, <script data-card-contents-for-ri="4205" type="text/json">{"id":4205,"name":"Data Analysis","url":"https://www.academia.edu/Documents/in/Data_Analysis?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="11035" href="https://www.academia.edu/Documents/in/Regulation">Regulation</a><script data-card-contents-for-ri="11035" type="text/json">{"id":11035,"name":"Regulation","url":"https://www.academia.edu/Documents/in/Regulation?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3656275]'), work: {"id":3656275,"title":"How to measure single-name credit risk concentrations","created_at":"2013-06-04T21:57:16.499-07:00","url":"https://www.academia.edu/3656275/How_to_measure_single_name_credit_risk_concentrations?f_ri=223634","dom_id":"work_3656275","summary":"Credit risk concentration is one of the leading topics in modern finance, as the bank regulation has made increasing use of external and internal credit ratings. Concentration risk in credit portfolios comes into being through an uneven distribution of bank loans to individual borrowers (single-name concentration) or in a hierarchical dimension such as in industry and services sectors and geographical regions (sectorial concentration).To measure single-name concentration risk the literature proposes specific concentration indexes such as the Herfindahl–Hirschman index, the Gini index or more general approaches to calculate the appropriate economic capital needed to cover the risk arising from the potential default of large borrowers.However, in our opinion, the Gini index and the Herfindahl–Hirschman index can be improved taking into account methodological and theoretical issues which are explained in this paper.We propose a new index to measure single-name credit concentration risk and we prove the properties of our contribution.Furthermore, considering the guidelines of Basel II, we describe how our index works on real financial data. Finally, we compare our index with the common procedures proposed in the literature on the basis of simulated and real data.","downloadable_attachments":[{"id":50191361,"asset_id":3656275,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4439457,"first_name":"Silvia","last_name":"Figini","domain_name":"unipv","page_name":"SilviaFigini","display_name":"Silvia Figini","profile_url":"https://unipv.academia.edu/SilviaFigini?f_ri=223634","photo":"https://0.academia-photos.com/4439457/1811780/2158744/s65_silvia.figini.jpg"}],"research_interests":[{"id":47,"name":"Finance","url":"https://www.academia.edu/Documents/in/Finance?f_ri=223634","nofollow":false},{"id":2009,"name":"Data Mining","url":"https://www.academia.edu/Documents/in/Data_Mining?f_ri=223634","nofollow":false},{"id":4205,"name":"Data Analysis","url":"https://www.academia.edu/Documents/in/Data_Analysis?f_ri=223634","nofollow":false},{"id":11035,"name":"Regulation","url":"https://www.academia.edu/Documents/in/Regulation?f_ri=223634","nofollow":false},{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary?f_ri=223634"},{"id":45874,"name":"Decision support system","url":"https://www.academia.edu/Documents/in/Decision_support_system?f_ri=223634"},{"id":48127,"name":"Concentration","url":"https://www.academia.edu/Documents/in/Concentration?f_ri=223634"},{"id":53001,"name":"Economic Capital","url":"https://www.academia.edu/Documents/in/Economic_Capital?f_ri=223634"},{"id":80209,"name":"Credit Rating","url":"https://www.academia.edu/Documents/in/Credit_Rating?f_ri=223634"},{"id":84990,"name":"Clustering","url":"https://www.academia.edu/Documents/in/Clustering?f_ri=223634"},{"id":85068,"name":"Multicriteria Decision Analysis","url":"https://www.academia.edu/Documents/in/Multicriteria_Decision_Analysis?f_ri=223634"},{"id":85998,"name":"Credit Risk","url":"https://www.academia.edu/Documents/in/Credit_Risk?f_ri=223634"},{"id":99432,"name":"Multicriteria Decision Aid","url":"https://www.academia.edu/Documents/in/Multicriteria_Decision_Aid?f_ri=223634"},{"id":131237,"name":"Cluster Analysis","url":"https://www.academia.edu/Documents/in/Cluster_Analysis?f_ri=223634"},{"id":135164,"name":"Capital","url":"https://www.academia.edu/Documents/in/Capital?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":230439,"name":"Basel II","url":"https://www.academia.edu/Documents/in/Basel_II?f_ri=223634"},{"id":254626,"name":"Cluster","url":"https://www.academia.edu/Documents/in/Cluster?f_ri=223634"},{"id":311931,"name":"STOCK EXCHANGE","url":"https://www.academia.edu/Documents/in/STOCK_EXCHANGE?f_ri=223634"},{"id":327126,"name":"Clustering Method","url":"https://www.academia.edu/Documents/in/Clustering_Method?f_ri=223634"},{"id":459373,"name":"Gini Index","url":"https://www.academia.edu/Documents/in/Gini_Index?f_ri=223634"},{"id":481774,"name":"Bank Regulation","url":"https://www.academia.edu/Documents/in/Bank_Regulation?f_ri=223634"},{"id":749302,"name":"Indexation","url":"https://www.academia.edu/Documents/in/Indexation?f_ri=223634"},{"id":842265,"name":"Bank Loans","url":"https://www.academia.edu/Documents/in/Bank_Loans?f_ri=223634"},{"id":996089,"name":"Metric","url":"https://www.academia.edu/Documents/in/Metric?f_ri=223634"},{"id":1000054,"name":"Service Industries","url":"https://www.academia.edu/Documents/in/Service_Industries?f_ri=223634"},{"id":1034610,"name":"Service Sector","url":"https://www.academia.edu/Documents/in/Service_Sector?f_ri=223634"},{"id":1789202,"name":"Concentration Index","url":"https://www.academia.edu/Documents/in/Concentration_Index?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_41709297" data-work_id="41709297" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/41709297/SEARCHING_DAN_SORTING_PADA_DATA_DOSEN">SEARCHING DAN SORTING PADA DATA DOSEN</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">1. LATAR BELAKANG Pencarian (searching) merupakan suatu pekerjaan yang sering dikerjakan dalam kehidupan sehari-hari. Ada kalanya kita mencari sesuatu dengan tujuan hanya untuk mengetahui apakah data tersebut ada dalam sekumpulan data... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_41709297" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">1. LATAR BELAKANG Pencarian (searching) merupakan suatu pekerjaan yang sering dikerjakan dalam kehidupan sehari-hari. Ada kalanya kita mencari sesuatu dengan tujuan hanya untuk mengetahui apakah data tersebut ada dalam sekumpulan data atau tidak, sementara di lain waktu mungkin kita menginginkan posisi dari data yang dicari tersebut. Dalam Algoritma pencarian (searching,) ada beberapa metode pencarian Seperti: Metode linier (Linear Search), Metode Biner (Binary Search), Metode interpolasi (Interpolation Search). Masing-masing algoritma memiliki prasyarat dan cara serta waktu pelaksanaan yang berbeda. Pemilihan atas metoda pencarian dilakukan berdasarkan keadaan dan keinginan pengguna metoda yang biasanya tergantung pada jumlah data, jenis data dan struktur data yang digunakan. Sedangkan sorting mempunyai beberapa metode dalam pengurutan, diantaranya: Bubble Sorting, Selection Sorting, Insertion Sorting, Merge Sorting, Quick Sorting. Judul laporan praktikum matakuliah praktikum algoritma dan pemrograman III ini adalah Searching dan Sorting. Searching dibagi menjadi dua bagian, yaitu: Sequential Search dan Binary Search. Salah satu tujuan membuat laporan praktikum ini adalah sebagai syarat kelulusan matakuliah praktikum Algoritma dan Pemrograman III. 2. RUMUSAN 1. Bagaimana merancang searching dan sorting. 2. Bagaimana mengimplementasikan program searching dan sorting.PHP?</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/41709297" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="002543cd76d6f0b4d791da5c3646278e" rel="nofollow" data-download="{"attachment_id":61867870,"asset_id":41709297,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/61867870/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="69616156" href="https://independent.academia.edu/BarlanthyMujaya">Barlanthy Mujaya</a><script data-card-contents-for-user="69616156" type="text/json">{"id":69616156,"first_name":"Barlanthy","last_name":"Mujaya","domain_name":"independent","page_name":"BarlanthyMujaya","display_name":"Barlanthy Mujaya","profile_url":"https://independent.academia.edu/BarlanthyMujaya?f_ri=223634","photo":"https://0.academia-photos.com/69616156/22569453/21760394/s65_barlanthy.mujaya.jpg"}</script></span></span></li><li class="js-paper-rank-work_41709297 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="41709297"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 41709297, container: ".js-paper-rank-work_41709297", }); });</script></li><li class="js-percentile-work_41709297 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 41709297; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_41709297"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_41709297 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="41709297"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 41709297; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=41709297]").text(description); $(".js-view-count-work_41709297").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_41709297").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="41709297"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">2</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a>, <script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="263918" href="https://www.academia.edu/Documents/in/Searching">Searching</a><script data-card-contents-for-ri="263918" type="text/json">{"id":263918,"name":"Searching","url":"https://www.academia.edu/Documents/in/Searching?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=41709297]'), work: {"id":41709297,"title":"SEARCHING DAN SORTING PADA DATA DOSEN","created_at":"2020-01-22T23:30:16.758-08:00","url":"https://www.academia.edu/41709297/SEARCHING_DAN_SORTING_PADA_DATA_DOSEN?f_ri=223634","dom_id":"work_41709297","summary":"1. LATAR BELAKANG Pencarian (searching) merupakan suatu pekerjaan yang sering dikerjakan dalam kehidupan sehari-hari. Ada kalanya kita mencari sesuatu dengan tujuan hanya untuk mengetahui apakah data tersebut ada dalam sekumpulan data atau tidak, sementara di lain waktu mungkin kita menginginkan posisi dari data yang dicari tersebut. Dalam Algoritma pencarian (searching,) ada beberapa metode pencarian Seperti: Metode linier (Linear Search), Metode Biner (Binary Search), Metode interpolasi (Interpolation Search). Masing-masing algoritma memiliki prasyarat dan cara serta waktu pelaksanaan yang berbeda. Pemilihan atas metoda pencarian dilakukan berdasarkan keadaan dan keinginan pengguna metoda yang biasanya tergantung pada jumlah data, jenis data dan struktur data yang digunakan. Sedangkan sorting mempunyai beberapa metode dalam pengurutan, diantaranya: Bubble Sorting, Selection Sorting, Insertion Sorting, Merge Sorting, Quick Sorting. Judul laporan praktikum matakuliah praktikum algoritma dan pemrograman III ini adalah Searching dan Sorting. Searching dibagi menjadi dua bagian, yaitu: Sequential Search dan Binary Search. Salah satu tujuan membuat laporan praktikum ini adalah sebagai syarat kelulusan matakuliah praktikum Algoritma dan Pemrograman III. 2. RUMUSAN 1. Bagaimana merancang searching dan sorting. 2. Bagaimana mengimplementasikan program searching dan sorting.PHP?","downloadable_attachments":[{"id":61867870,"asset_id":41709297,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":69616156,"first_name":"Barlanthy","last_name":"Mujaya","domain_name":"independent","page_name":"BarlanthyMujaya","display_name":"Barlanthy Mujaya","profile_url":"https://independent.academia.edu/BarlanthyMujaya?f_ri=223634","photo":"https://0.academia-photos.com/69616156/22569453/21760394/s65_barlanthy.mujaya.jpg"}],"research_interests":[{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false},{"id":263918,"name":"Searching","url":"https://www.academia.edu/Documents/in/Searching?f_ri=223634","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4327677" data-work_id="4327677" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4327677/MOEA_D_A_Multiobjective_Evolutionary_Algorithm_Based_on_Decomposition">MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4327677" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bcdf57b2ab07ddfd7dc6c42d32e4a5f6" rel="nofollow" data-download="{"attachment_id":31781452,"asset_id":4327677,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31781452/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="187785" href="https://essex.academia.edu/QingfuZhang">Qingfu Zhang</a><script data-card-contents-for-user="187785" type="text/json">{"id":187785,"first_name":"Qingfu","last_name":"Zhang","domain_name":"essex","page_name":"QingfuZhang","display_name":"Qingfu Zhang","profile_url":"https://essex.academia.edu/QingfuZhang?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_4327677 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4327677"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4327677, container: ".js-paper-rank-work_4327677", }); });</script></li><li class="js-percentile-work_4327677 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4327677; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4327677"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4327677 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4327677"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4327677; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4327677]").text(description); $(".js-view-count-work_4327677").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4327677").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4327677"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="37" href="https://www.academia.edu/Documents/in/Information_Systems">Information Systems</a>, <script data-card-contents-for-ri="37" type="text/json">{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2189" href="https://www.academia.edu/Documents/in/Computational_Complexity">Computational Complexity</a>, <script data-card-contents-for-ri="2189" type="text/json">{"id":2189,"name":"Computational Complexity","url":"https://www.academia.edu/Documents/in/Computational_Complexity?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5026" href="https://www.academia.edu/Documents/in/Genetic_Algorithms">Genetic Algorithms</a>, <script data-card-contents-for-ri="5026" type="text/json">{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5446" href="https://www.academia.edu/Documents/in/Mathematical_Programming">Mathematical Programming</a><script data-card-contents-for-ri="5446" type="text/json">{"id":5446,"name":"Mathematical Programming","url":"https://www.academia.edu/Documents/in/Mathematical_Programming?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4327677]'), work: {"id":4327677,"title":"MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition","created_at":"2013-08-25T23:44:53.731-07:00","url":"https://www.academia.edu/4327677/MOEA_D_A_Multiobjective_Evolutionary_Algorithm_Based_on_Decomposition?f_ri=223634","dom_id":"work_4327677","summary":null,"downloadable_attachments":[{"id":31781452,"asset_id":4327677,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":187785,"first_name":"Qingfu","last_name":"Zhang","domain_name":"essex","page_name":"QingfuZhang","display_name":"Qingfu Zhang","profile_url":"https://essex.academia.edu/QingfuZhang?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=223634","nofollow":false},{"id":2189,"name":"Computational Complexity","url":"https://www.academia.edu/Documents/in/Computational_Complexity?f_ri=223634","nofollow":false},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=223634","nofollow":false},{"id":5446,"name":"Mathematical Programming","url":"https://www.academia.edu/Documents/in/Mathematical_Programming?f_ri=223634","nofollow":false},{"id":6414,"name":"Decomposition","url":"https://www.academia.edu/Documents/in/Decomposition?f_ri=223634"},{"id":13445,"name":"Multiobjective Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Optimization?f_ri=223634"},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=223634"},{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm?f_ri=223634"},{"id":377043,"name":"Scalability","url":"https://www.academia.edu/Documents/in/Scalability?f_ri=223634"},{"id":552138,"name":"Adomian decomposition method","url":"https://www.academia.edu/Documents/in/Adomian_decomposition_method?f_ri=223634"},{"id":555139,"name":"Evolutionary optimization","url":"https://www.academia.edu/Documents/in/Evolutionary_optimization?f_ri=223634"},{"id":1032348,"name":"Pareto Optimality","url":"https://www.academia.edu/Documents/in/Pareto_Optimality?f_ri=223634"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=223634"},{"id":2221688,"name":"Knapsack Problem","url":"https://www.academia.edu/Documents/in/Knapsack_Problem?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_36364354" data-work_id="36364354" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/36364354/La_circulation_cosmique_des_%C3%A2mes_Platon_le_Mythe_dEr_in_Ducoeur_G_et_Muckensturm_Poulle_C_%C3%A9ds_La_transmigration_des_%C3%A2mes_en_Gr%C3%A8ce_et_en_Inde_ancienne_Besan%C3%A7on_Presses_Universitaires_de_Franche_Comt%C3%A9_2016_p_63_80">La circulation cosmique des âmes. Platon, le Mythe d'Er in Ducoeur G. et Muckensturm-Poulle C. (éds.), La transmigration des âmes en Grèce et en Inde ancienne, Besançon, Presses Universitaires de Franche-Comté, 2016, p. 63‑80.</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Plato in the Myth of Er alters the traditional view of the cosmos in Ancient Greece to allow for the doctrine of metempsychosis. The modification is threefold. A new topography is needed so that souls can circulate forever through heaven... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_36364354" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Plato in the Myth of Er alters the traditional view of the cosmos in Ancient Greece to allow for the doctrine of metempsychosis. The modification is threefold. A new topography is needed so that souls can circulate forever through heaven and the underworld. New social rites<br />are called for by an expanding demography: many souls being in transit, Plato suggests taking to the cosmos military and religious practices adapted to bigger crowds, and also adapts the traditional practice of drawing lots to big numbers. New analogies are also needed to give to<br />the many a representation of the mechanism of the universe: Plato brings the fuse of the spinner into the Sky in order to achieve that goal.<br />Platon, dans le Mythe d’Er, modifie la représentation traditionnelle du cosmos en Grèce ancienne pour y faire place à la doctrine de la transmigration des âmes. La modification concerne la topographie du Ciel et des Enfers de telle sorte que puisse s’y dérouler une circulation perpétuelle des âmes. Il s’agit aussi d’une modification démographique et sociale : le cosmos est traversé par un grand flux d’âmes, et Platon est amené à y transposer des pratiques militaires et religieuses adéquates aux collectivités, et à envisager une modification de la pratique traditionnelle du tirage au sort pour l’adapter aux grands nombres. Enfin, il donne une nouvelle analogie technique à la représentation de l’univers, avec la reconstitution grandiose de la mécanique céleste à partir du fuseau de la fileuse.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/36364354" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d742e1c39c80eca767a43eb016bf4bcb" rel="nofollow" data-download="{"attachment_id":56273730,"asset_id":36364354,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/56273730/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="5841558" href="https://univ-fcomte.academia.edu/ArnaudMac%C3%A9">Arnaud Macé</a><script data-card-contents-for-user="5841558" type="text/json">{"id":5841558,"first_name":"Arnaud","last_name":"Macé","domain_name":"univ-fcomte","page_name":"ArnaudMacé","display_name":"Arnaud Macé","profile_url":"https://univ-fcomte.academia.edu/ArnaudMac%C3%A9?f_ri=223634","photo":"https://0.academia-photos.com/5841558/2506264/2910039/s65_arnaud.mac_.jpg"}</script></span></span></li><li class="js-paper-rank-work_36364354 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="36364354"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 36364354, container: ".js-paper-rank-work_36364354", }); });</script></li><li class="js-percentile-work_36364354 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 36364354; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_36364354"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_36364354 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="36364354"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 36364354; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=36364354]").text(description); $(".js-view-count-work_36364354").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_36364354").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="36364354"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2018" href="https://www.academia.edu/Documents/in/Plato">Plato</a>, <script data-card-contents-for-ri="2018" type="text/json">{"id":2018,"name":"Plato","url":"https://www.academia.edu/Documents/in/Plato?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3497" href="https://www.academia.edu/Documents/in/Cosmology_Anthropology_">Cosmology (Anthropology)</a>, <script data-card-contents-for-ri="3497" type="text/json">{"id":3497,"name":"Cosmology (Anthropology)","url":"https://www.academia.edu/Documents/in/Cosmology_Anthropology_?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="18118" href="https://www.academia.edu/Documents/in/Ancient_Greek_Religion">Ancient Greek Religion</a>, <script data-card-contents-for-ri="18118" type="text/json">{"id":18118,"name":"Ancient Greek Religion","url":"https://www.academia.edu/Documents/in/Ancient_Greek_Religion?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="24771" href="https://www.academia.edu/Documents/in/Eschatology">Eschatology</a><script data-card-contents-for-ri="24771" type="text/json">{"id":24771,"name":"Eschatology","url":"https://www.academia.edu/Documents/in/Eschatology?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=36364354]'), work: {"id":36364354,"title":"La circulation cosmique des âmes. Platon, le Mythe d'Er in Ducoeur G. et Muckensturm-Poulle C. (éds.), La transmigration des âmes en Grèce et en Inde ancienne, Besançon, Presses Universitaires de Franche-Comté, 2016, p. 63‑80.","created_at":"2018-04-09T02:10:03.939-07:00","url":"https://www.academia.edu/36364354/La_circulation_cosmique_des_%C3%A2mes_Platon_le_Mythe_dEr_in_Ducoeur_G_et_Muckensturm_Poulle_C_%C3%A9ds_La_transmigration_des_%C3%A2mes_en_Gr%C3%A8ce_et_en_Inde_ancienne_Besan%C3%A7on_Presses_Universitaires_de_Franche_Comt%C3%A9_2016_p_63_80?f_ri=223634","dom_id":"work_36364354","summary":"Plato in the Myth of Er alters the traditional view of the cosmos in Ancient Greece to allow for the doctrine of metempsychosis. The modification is threefold. A new topography is needed so that souls can circulate forever through heaven and the underworld. New social rites\nare called for by an expanding demography: many souls being in transit, Plato suggests taking to the cosmos military and religious practices adapted to bigger crowds, and also adapts the traditional practice of drawing lots to big numbers. New analogies are also needed to give to\nthe many a representation of the mechanism of the universe: Plato brings the fuse of the spinner into the Sky in order to achieve that goal.\nPlaton, dans le Mythe d’Er, modifie la représentation traditionnelle du cosmos en Grèce ancienne pour y faire place à la doctrine de la transmigration des âmes. La modification concerne la topographie du Ciel et des Enfers de telle sorte que puisse s’y dérouler une circulation perpétuelle des âmes. Il s’agit aussi d’une modification démographique et sociale : le cosmos est traversé par un grand flux d’âmes, et Platon est amené à y transposer des pratiques militaires et religieuses adéquates aux collectivités, et à envisager une modification de la pratique traditionnelle du tirage au sort pour l’adapter aux grands nombres. Enfin, il donne une nouvelle analogie technique à la représentation de l’univers, avec la reconstitution grandiose de la mécanique céleste à partir du fuseau de la fileuse. ","downloadable_attachments":[{"id":56273730,"asset_id":36364354,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":5841558,"first_name":"Arnaud","last_name":"Macé","domain_name":"univ-fcomte","page_name":"ArnaudMacé","display_name":"Arnaud Macé","profile_url":"https://univ-fcomte.academia.edu/ArnaudMac%C3%A9?f_ri=223634","photo":"https://0.academia-photos.com/5841558/2506264/2910039/s65_arnaud.mac_.jpg"}],"research_interests":[{"id":2018,"name":"Plato","url":"https://www.academia.edu/Documents/in/Plato?f_ri=223634","nofollow":false},{"id":3497,"name":"Cosmology (Anthropology)","url":"https://www.academia.edu/Documents/in/Cosmology_Anthropology_?f_ri=223634","nofollow":false},{"id":18118,"name":"Ancient Greek Religion","url":"https://www.academia.edu/Documents/in/Ancient_Greek_Religion?f_ri=223634","nofollow":false},{"id":24771,"name":"Eschatology","url":"https://www.academia.edu/Documents/in/Eschatology?f_ri=223634","nofollow":false},{"id":25198,"name":"Ancient Greek Philosophy","url":"https://www.academia.edu/Documents/in/Ancient_Greek_Philosophy?f_ri=223634"},{"id":25507,"name":"Analogy (Philosophy)","url":"https://www.academia.edu/Documents/in/Analogy_Philosophy_?f_ri=223634"},{"id":28362,"name":"Classical Mythology","url":"https://www.academia.edu/Documents/in/Classical_Mythology?f_ri=223634"},{"id":109253,"name":"Transmigration","url":"https://www.academia.edu/Documents/in/Transmigration?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":261284,"name":"Spinning, Weaving \u0026 processing","url":"https://www.academia.edu/Documents/in/Spinning_Weaving_and_processing?f_ri=223634"},{"id":631685,"name":"Metempsychosis","url":"https://www.academia.edu/Documents/in/Metempsychosis?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3985979" data-work_id="3985979" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3985979/Cubesort_A_Parallel_Algorithm_for_Sorting_N_Data_Items_with_S_Sorters">Cubesort: A Parallel Algorithm for Sorting N Data Items with S-Sorters</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3985979" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="cce987272e7c01944873bdce24b60015" rel="nofollow" data-download="{"attachment_id":50098274,"asset_id":3985979,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50098274/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4790246" href="https://ibm.academia.edu/JorgeSanz">Jorge Sanz</a><script data-card-contents-for-user="4790246" type="text/json">{"id":4790246,"first_name":"Jorge","last_name":"Sanz","domain_name":"ibm","page_name":"JorgeSanz","display_name":"Jorge Sanz","profile_url":"https://ibm.academia.edu/JorgeSanz?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_3985979 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3985979"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3985979, container: ".js-paper-rank-work_3985979", }); });</script></li><li class="js-percentile-work_3985979 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3985979; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3985979"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3985979 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3985979"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3985979; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3985979]").text(description); $(".js-view-count-work_3985979").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3985979").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3985979"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="428" href="https://www.academia.edu/Documents/in/Algorithms">Algorithms</a>, <script data-card-contents-for-ri="428" type="text/json">{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="22686" href="https://www.academia.edu/Documents/in/Distributed_System">Distributed System</a>, <script data-card-contents-for-ri="22686" type="text/json">{"id":22686,"name":"Distributed System","url":"https://www.academia.edu/Documents/in/Distributed_System?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="109799" href="https://www.academia.edu/Documents/in/Multiprocessor_Scheduling">Multiprocessor Scheduling</a>, <script data-card-contents-for-ri="109799" type="text/json">{"id":109799,"name":"Multiprocessor Scheduling","url":"https://www.academia.edu/Documents/in/Multiprocessor_Scheduling?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="209855" href="https://www.academia.edu/Documents/in/Time_Complexity">Time Complexity</a><script data-card-contents-for-ri="209855" type="text/json">{"id":209855,"name":"Time Complexity","url":"https://www.academia.edu/Documents/in/Time_Complexity?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3985979]'), work: {"id":3985979,"title":"Cubesort: A Parallel Algorithm for Sorting N Data Items with S-Sorters","created_at":"2013-07-09T05:01:08.378-07:00","url":"https://www.academia.edu/3985979/Cubesort_A_Parallel_Algorithm_for_Sorting_N_Data_Items_with_S_Sorters?f_ri=223634","dom_id":"work_3985979","summary":null,"downloadable_attachments":[{"id":50098274,"asset_id":3985979,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4790246,"first_name":"Jorge","last_name":"Sanz","domain_name":"ibm","page_name":"JorgeSanz","display_name":"Jorge Sanz","profile_url":"https://ibm.academia.edu/JorgeSanz?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=223634","nofollow":false},{"id":22686,"name":"Distributed System","url":"https://www.academia.edu/Documents/in/Distributed_System?f_ri=223634","nofollow":false},{"id":109799,"name":"Multiprocessor Scheduling","url":"https://www.academia.edu/Documents/in/Multiprocessor_Scheduling?f_ri=223634","nofollow":false},{"id":209855,"name":"Time Complexity","url":"https://www.academia.edu/Documents/in/Time_Complexity?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":238655,"name":"Implementation","url":"https://www.academia.edu/Documents/in/Implementation?f_ri=223634"},{"id":269983,"name":"Computer System","url":"https://www.academia.edu/Documents/in/Computer_System?f_ri=223634"},{"id":271412,"name":"HyperCube","url":"https://www.academia.edu/Documents/in/HyperCube?f_ri=223634"},{"id":348986,"name":"Parallel Algorithm","url":"https://www.academia.edu/Documents/in/Parallel_Algorithm?f_ri=223634"},{"id":581652,"name":"Data Processing","url":"https://www.academia.edu/Documents/in/Data_Processing?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_75416364" data-work_id="75416364" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/75416364/Pasting_characteristics_of_starches_in_flours_of_chickpea_Cicer_arietinum_L_and_faba_bean_Vicia_faba_L_as_affected_by_sorting_and_dehulling_practices">Pasting characteristics of starches in flours of chickpea (Cicer arietinum L.) and faba bean (Vicia faba L.) as affected by sorting and dehulling practices</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/75416364" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c9c6370c5dcd40077795e6eacf51cbd1" rel="nofollow" data-download="{"attachment_id":83193605,"asset_id":75416364,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/83193605/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="27274083" href="https://tamu.academia.edu/TadesseTeferraPhD">Tadesse F Teferra (PhD)</a><script data-card-contents-for-user="27274083" type="text/json">{"id":27274083,"first_name":"Tadesse","last_name":"Teferra (PhD)","domain_name":"tamu","page_name":"TadesseTeferraPhD","display_name":"Tadesse F Teferra (PhD)","profile_url":"https://tamu.academia.edu/TadesseTeferraPhD?f_ri=223634","photo":"https://0.academia-photos.com/27274083/7742217/34433024/s65_tadesse.teferra.jpg"}</script></span></span></li><li class="js-paper-rank-work_75416364 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="75416364"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 75416364, container: ".js-paper-rank-work_75416364", }); });</script></li><li class="js-percentile-work_75416364 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 75416364; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_75416364"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_75416364 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="75416364"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 75416364; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=75416364]").text(description); $(".js-view-count-work_75416364").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_75416364").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="75416364"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="128" href="https://www.academia.edu/Documents/in/History">History</a>, <script data-card-contents-for-ri="128" type="text/json">{"id":128,"name":"History","url":"https://www.academia.edu/Documents/in/History?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="94802" href="https://www.academia.edu/Documents/in/Academic_Journals">Academic Journals</a>, <script data-card-contents-for-ri="94802" type="text/json">{"id":94802,"name":"Academic Journals","url":"https://www.academia.edu/Documents/in/Academic_Journals?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143904" href="https://www.academia.edu/Documents/in/Legumes">Legumes</a>, <script data-card-contents-for-ri="143904" type="text/json">{"id":143904,"name":"Legumes","url":"https://www.academia.edu/Documents/in/Legumes?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="202427" href="https://www.academia.edu/Documents/in/Chickpea">Chickpea</a><script data-card-contents-for-ri="202427" type="text/json">{"id":202427,"name":"Chickpea","url":"https://www.academia.edu/Documents/in/Chickpea?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=75416364]'), work: {"id":75416364,"title":"Pasting characteristics of starches in flours of chickpea (Cicer arietinum L.) and faba bean (Vicia faba L.) as affected by sorting and dehulling practices","created_at":"2022-04-04T05:23:17.342-07:00","url":"https://www.academia.edu/75416364/Pasting_characteristics_of_starches_in_flours_of_chickpea_Cicer_arietinum_L_and_faba_bean_Vicia_faba_L_as_affected_by_sorting_and_dehulling_practices?f_ri=223634","dom_id":"work_75416364","summary":null,"downloadable_attachments":[{"id":83193605,"asset_id":75416364,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":27274083,"first_name":"Tadesse","last_name":"Teferra (PhD)","domain_name":"tamu","page_name":"TadesseTeferraPhD","display_name":"Tadesse F Teferra (PhD)","profile_url":"https://tamu.academia.edu/TadesseTeferraPhD?f_ri=223634","photo":"https://0.academia-photos.com/27274083/7742217/34433024/s65_tadesse.teferra.jpg"}],"research_interests":[{"id":128,"name":"History","url":"https://www.academia.edu/Documents/in/History?f_ri=223634","nofollow":false},{"id":94802,"name":"Academic Journals","url":"https://www.academia.edu/Documents/in/Academic_Journals?f_ri=223634","nofollow":false},{"id":143904,"name":"Legumes","url":"https://www.academia.edu/Documents/in/Legumes?f_ri=223634","nofollow":false},{"id":202427,"name":"Chickpea","url":"https://www.academia.edu/Documents/in/Chickpea?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":380357,"name":"Vicia faba","url":"https://www.academia.edu/Documents/in/Vicia_faba?f_ri=223634"},{"id":387140,"name":"Postharvest Technology","url":"https://www.academia.edu/Documents/in/Postharvest_Technology?f_ri=223634"},{"id":2235646,"name":"Dehulling","url":"https://www.academia.edu/Documents/in/Dehulling?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_1238199" data-work_id="1238199" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/1238199/MOPSO_A_proposal_for_multiple_objective_particle_swarm_optimization">MOPSO: A proposal for multiple objective particle swarm optimization</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/1238199" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="69b146270e86fa128ec2882c949a4b45" rel="nofollow" data-download="{"attachment_id":19374288,"asset_id":1238199,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/19374288/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="1977824" href="https://independent.academia.edu/NithishkumarVenkatachalam">Nithishkumar Venkatachalam</a><script data-card-contents-for-user="1977824" type="text/json">{"id":1977824,"first_name":"Nithishkumar","last_name":"Venkatachalam","domain_name":"independent","page_name":"NithishkumarVenkatachalam","display_name":"Nithishkumar Venkatachalam","profile_url":"https://independent.academia.edu/NithishkumarVenkatachalam?f_ri=223634","photo":"https://0.academia-photos.com/1977824/655694/814104/s65_nithishkumar.venkatachalam.jpg"}</script></span></span></li><li class="js-paper-rank-work_1238199 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="1238199"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 1238199, container: ".js-paper-rank-work_1238199", }); });</script></li><li class="js-percentile-work_1238199 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 1238199; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_1238199"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_1238199 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="1238199"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 1238199; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=1238199]").text(description); $(".js-view-count-work_1238199").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_1238199").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="1238199"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2535" href="https://www.academia.edu/Documents/in/Operations_Research">Operations Research</a>, <script data-card-contents-for-ri="2535" type="text/json">{"id":2535,"name":"Operations Research","url":"https://www.academia.edu/Documents/in/Operations_Research?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3523" href="https://www.academia.edu/Documents/in/Evolutionary_Computation">Evolutionary Computation</a>, <script data-card-contents-for-ri="3523" type="text/json">{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5026" href="https://www.academia.edu/Documents/in/Genetic_Algorithms">Genetic Algorithms</a>, <script data-card-contents-for-ri="5026" type="text/json">{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="13445" href="https://www.academia.edu/Documents/in/Multiobjective_Optimization">Multiobjective Optimization</a><script data-card-contents-for-ri="13445" type="text/json">{"id":13445,"name":"Multiobjective Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Optimization?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=1238199]'), work: {"id":1238199,"title":"MOPSO: A proposal for multiple objective particle swarm optimization","created_at":"2012-06-19T15:02:40.773-07:00","url":"https://www.academia.edu/1238199/MOPSO_A_proposal_for_multiple_objective_particle_swarm_optimization?f_ri=223634","dom_id":"work_1238199","summary":null,"downloadable_attachments":[{"id":19374288,"asset_id":1238199,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":1977824,"first_name":"Nithishkumar","last_name":"Venkatachalam","domain_name":"independent","page_name":"NithishkumarVenkatachalam","display_name":"Nithishkumar Venkatachalam","profile_url":"https://independent.academia.edu/NithishkumarVenkatachalam?f_ri=223634","photo":"https://0.academia-photos.com/1977824/655694/814104/s65_nithishkumar.venkatachalam.jpg"}],"research_interests":[{"id":2535,"name":"Operations Research","url":"https://www.academia.edu/Documents/in/Operations_Research?f_ri=223634","nofollow":false},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation?f_ri=223634","nofollow":false},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=223634","nofollow":false},{"id":13445,"name":"Multiobjective Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Optimization?f_ri=223634","nofollow":false},{"id":25896,"name":"Particle Swarm Optimization","url":"https://www.academia.edu/Documents/in/Particle_Swarm_Optimization?f_ri=223634"},{"id":56605,"name":"Multiobjective Evolutionary Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Evolutionary_Optimization?f_ri=223634"},{"id":201957,"name":"Acceleration","url":"https://www.academia.edu/Documents/in/Acceleration?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":419504,"name":"Heuristic","url":"https://www.academia.edu/Documents/in/Heuristic?f_ri=223634"},{"id":862243,"name":"Multiple Objectives","url":"https://www.academia.edu/Documents/in/Multiple_Objectives?f_ri=223634"},{"id":1132242,"name":"Multidimensional Systems","url":"https://www.academia.edu/Documents/in/Multidimensional_Systems?f_ri=223634"},{"id":1330964,"name":"Particle Swarm Optimizer","url":"https://www.academia.edu/Documents/in/Particle_Swarm_Optimizer?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_28732770" data-work_id="28732770" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/28732770/Optimizing_Sorting_with_Genetic_Algorithms">Optimizing Sorting with Genetic Algorithms</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/28732770" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f7d075dc4306a23a66e9d5437a1e9ddd" rel="nofollow" data-download="{"attachment_id":49143328,"asset_id":28732770,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49143328/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="54060829" href="https://independent.academia.edu/MariajesusGarzaran">Maria-jesus Garzaran</a><script data-card-contents-for-user="54060829" type="text/json">{"id":54060829,"first_name":"Maria-jesus","last_name":"Garzaran","domain_name":"independent","page_name":"MariajesusGarzaran","display_name":"Maria-jesus Garzaran","profile_url":"https://independent.academia.edu/MariajesusGarzaran?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_28732770 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="28732770"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 28732770, container: ".js-paper-rank-work_28732770", }); });</script></li><li class="js-percentile-work_28732770 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 28732770; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_28732770"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_28732770 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="28732770"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 28732770; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=28732770]").text(description); $(".js-view-count-work_28732770").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_28732770").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="28732770"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="433" href="https://www.academia.edu/Documents/in/Computer_Architecture">Computer Architecture</a>, <script data-card-contents-for-ri="433" type="text/json">{"id":433,"name":"Computer Architecture","url":"https://www.academia.edu/Documents/in/Computer_Architecture?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2008" href="https://www.academia.edu/Documents/in/Machine_Learning">Machine Learning</a>, <script data-card-contents-for-ri="2008" type="text/json">{"id":2008,"name":"Machine Learning","url":"https://www.academia.edu/Documents/in/Machine_Learning?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5026" href="https://www.academia.edu/Documents/in/Genetic_Algorithms">Genetic Algorithms</a>, <script data-card-contents-for-ri="5026" type="text/json">{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="30329" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a><script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=28732770]'), work: {"id":28732770,"title":"Optimizing Sorting with Genetic Algorithms","created_at":"2016-09-26T20:12:12.741-07:00","url":"https://www.academia.edu/28732770/Optimizing_Sorting_with_Genetic_Algorithms?f_ri=223634","dom_id":"work_28732770","summary":null,"downloadable_attachments":[{"id":49143328,"asset_id":28732770,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":54060829,"first_name":"Maria-jesus","last_name":"Garzaran","domain_name":"independent","page_name":"MariajesusGarzaran","display_name":"Maria-jesus Garzaran","profile_url":"https://independent.academia.edu/MariajesusGarzaran?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":433,"name":"Computer Architecture","url":"https://www.academia.edu/Documents/in/Computer_Architecture?f_ri=223634","nofollow":false},{"id":2008,"name":"Machine Learning","url":"https://www.academia.edu/Documents/in/Machine_Learning?f_ri=223634","nofollow":false},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=223634","nofollow":false},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=223634","nofollow":false},{"id":69841,"name":"Standard Deviation","url":"https://www.academia.edu/Documents/in/Standard_Deviation?f_ri=223634"},{"id":72415,"name":"Power Generation","url":"https://www.academia.edu/Documents/in/Power_Generation?f_ri=223634"},{"id":135177,"name":"Code Generation","url":"https://www.academia.edu/Documents/in/Code_Generation?f_ri=223634"},{"id":135179,"name":"Instruction Scheduling","url":"https://www.academia.edu/Documents/in/Instruction_Scheduling?f_ri=223634"},{"id":141744,"name":"Classifier System","url":"https://www.academia.edu/Documents/in/Classifier_System?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":585882,"name":"Sorting Algorithm","url":"https://www.academia.edu/Documents/in/Sorting_Algorithm?f_ri=223634"},{"id":971364,"name":"Spirals","url":"https://www.academia.edu/Documents/in/Spirals?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_23025482" data-work_id="23025482" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/23025482/NHS_Direct_and_nurses_opportunity_or_monotony">NHS Direct and nurses—opportunity or monotony?</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/23025482" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="96e5ec3795725e79aed1c33a2cab8ae6" rel="nofollow" data-download="{"attachment_id":43536055,"asset_id":23025482,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/43536055/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="44752806" href="https://independent.academia.edu/EmmaKnowles">Emma Knowles</a><script data-card-contents-for-user="44752806" type="text/json">{"id":44752806,"first_name":"Emma","last_name":"Knowles","domain_name":"independent","page_name":"EmmaKnowles","display_name":"Emma Knowles","profile_url":"https://independent.academia.edu/EmmaKnowles?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_23025482 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="23025482"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 23025482, container: ".js-paper-rank-work_23025482", }); });</script></li><li class="js-percentile-work_23025482 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 23025482; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_23025482"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_23025482 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="23025482"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 23025482; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=23025482]").text(description); $(".js-view-count-work_23025482").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_23025482").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="23025482"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">14</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="588" href="https://www.academia.edu/Documents/in/Nursing">Nursing</a>, <script data-card-contents-for-ri="588" type="text/json">{"id":588,"name":"Nursing","url":"https://www.academia.edu/Documents/in/Nursing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="8688" href="https://www.academia.edu/Documents/in/Job_Satisfaction">Job Satisfaction</a>, <script data-card-contents-for-ri="8688" type="text/json">{"id":8688,"name":"Job Satisfaction","url":"https://www.academia.edu/Documents/in/Job_Satisfaction?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="16288" href="https://www.academia.edu/Documents/in/Public_Health">Public Health</a>, <script data-card-contents-for-ri="16288" type="text/json">{"id":16288,"name":"Public Health","url":"https://www.academia.edu/Documents/in/Public_Health?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="37905" href="https://www.academia.edu/Documents/in/Counseling">Counseling</a><script data-card-contents-for-ri="37905" type="text/json">{"id":37905,"name":"Counseling","url":"https://www.academia.edu/Documents/in/Counseling?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=23025482]'), work: {"id":23025482,"title":"NHS Direct and nurses—opportunity or monotony?","created_at":"2016-03-09T01:27:03.364-08:00","url":"https://www.academia.edu/23025482/NHS_Direct_and_nurses_opportunity_or_monotony?f_ri=223634","dom_id":"work_23025482","summary":null,"downloadable_attachments":[{"id":43536055,"asset_id":23025482,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":44752806,"first_name":"Emma","last_name":"Knowles","domain_name":"independent","page_name":"EmmaKnowles","display_name":"Emma Knowles","profile_url":"https://independent.academia.edu/EmmaKnowles?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":588,"name":"Nursing","url":"https://www.academia.edu/Documents/in/Nursing?f_ri=223634","nofollow":false},{"id":8688,"name":"Job Satisfaction","url":"https://www.academia.edu/Documents/in/Job_Satisfaction?f_ri=223634","nofollow":false},{"id":16288,"name":"Public Health","url":"https://www.academia.edu/Documents/in/Public_Health?f_ri=223634","nofollow":false},{"id":37905,"name":"Counseling","url":"https://www.academia.edu/Documents/in/Counseling?f_ri=223634","nofollow":false},{"id":50892,"name":"Call Centre","url":"https://www.academia.edu/Documents/in/Call_Centre?f_ri=223634"},{"id":69015,"name":"England and Wales","url":"https://www.academia.edu/Documents/in/England_and_Wales?f_ri=223634"},{"id":69956,"name":"Triage","url":"https://www.academia.edu/Documents/in/Triage?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":243803,"name":"Nurse","url":"https://www.academia.edu/Documents/in/Nurse?f_ri=223634"},{"id":327850,"name":"Questionnaires","url":"https://www.academia.edu/Documents/in/Questionnaires?f_ri=223634"},{"id":330816,"name":"Career Choice","url":"https://www.academia.edu/Documents/in/Career_Choice?f_ri=223634"},{"id":387476,"name":"Health Problems","url":"https://www.academia.edu/Documents/in/Health_Problems?f_ri=223634"},{"id":449762,"name":"Nursing Studies","url":"https://www.academia.edu/Documents/in/Nursing_Studies?f_ri=223634"},{"id":727158,"name":"Hotlines","url":"https://www.academia.edu/Documents/in/Hotlines?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_10612697" data-work_id="10612697" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/10612697/Arrangement_of_primary_and_secondary_reformers_for_synthesis_gas_production">Arrangement of primary and secondary reformers for synthesis gas production</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In order to produce synthesis gas (syngas), four reforming processes including two stand-alone primary and secondary reformers and two combined configurations are investigated. With changing operating parameters and arrangement of the... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_10612697" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In order to produce synthesis gas (syngas), four reforming processes including two stand-alone primary and secondary reformers and two combined configurations are investigated. With changing operating parameters and arrangement of the reformers (i.e. stand-alone, parallel, and series), the syngas may be obtained for different applications such as methanol, Fischer-Tropsch (FT), and ammonia synthesis. After study of several arrangements, the selected cases are simulated. Due to the shift some reforming duty from the primary reformer to the secondary one, the primary size and the total fired duty are reduced. The Non-Sorting Genetic Algorithm II (NSGA-II) optimization method is applied for the problem based on the practical point of view. It is shown that the parallel case is preferable in accordance to the high productivity object. For an optimum point, parallel case has 58% of productivity of syngas more than that of series one. However, the series configuration consumes lower fuel (361.1 kmol h−1, in comparison to the parallel case with 437.19) and releases lower amount of CO2 emission. It is shown that the series arrangement has an average of 13.22% of released CO2 molar flow less than that of parallel arrangement.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/10612697" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d6d95f0c82a5e5b14f248f8a88945210" rel="nofollow" data-download="{"attachment_id":47261822,"asset_id":10612697,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47261822/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="25930734" href="https://independent.academia.edu/ebrahimihadis">hadis ebrahimi</a><script data-card-contents-for-user="25930734" type="text/json">{"id":25930734,"first_name":"hadis","last_name":"ebrahimi","domain_name":"independent","page_name":"ebrahimihadis","display_name":"hadis ebrahimi","profile_url":"https://independent.academia.edu/ebrahimihadis?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_10612697 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="10612697"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 10612697, container: ".js-paper-rank-work_10612697", }); });</script></li><li class="js-percentile-work_10612697 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 10612697; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_10612697"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_10612697 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="10612697"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 10612697; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=10612697]").text(description); $(".js-view-count-work_10612697").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_10612697").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="10612697"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">13</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="72" href="https://www.academia.edu/Documents/in/Chemical_Engineering">Chemical Engineering</a>, <script data-card-contents-for-ri="72" type="text/json">{"id":72,"name":"Chemical Engineering","url":"https://www.academia.edu/Documents/in/Chemical_Engineering?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3442" href="https://www.academia.edu/Documents/in/Production">Production</a>, <script data-card-contents-for-ri="3442" type="text/json">{"id":3442,"name":"Production","url":"https://www.academia.edu/Documents/in/Production?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="30329" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a>, <script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="43981" href="https://www.academia.edu/Documents/in/Optimization">Optimization</a><script data-card-contents-for-ri="43981" type="text/json">{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=10612697]'), work: {"id":10612697,"title":"Arrangement of primary and secondary reformers for synthesis gas production","created_at":"2015-02-07T23:25:24.089-08:00","url":"https://www.academia.edu/10612697/Arrangement_of_primary_and_secondary_reformers_for_synthesis_gas_production?f_ri=223634","dom_id":"work_10612697","summary":"In order to produce synthesis gas (syngas), four reforming processes including two stand-alone primary and secondary reformers and two combined configurations are investigated. With changing operating parameters and arrangement of the reformers (i.e. stand-alone, parallel, and series), the syngas may be obtained for different applications such as methanol, Fischer-Tropsch (FT), and ammonia synthesis. After study of several arrangements, the selected cases are simulated. Due to the shift some reforming duty from the primary reformer to the secondary one, the primary size and the total fired duty are reduced. The Non-Sorting Genetic Algorithm II (NSGA-II) optimization method is applied for the problem based on the practical point of view. It is shown that the parallel case is preferable in accordance to the high productivity object. For an optimum point, parallel case has 58% of productivity of syngas more than that of series one. However, the series configuration consumes lower fuel (361.1 kmol h−1, in comparison to the parallel case with 437.19) and releases lower amount of CO2 emission. It is shown that the series arrangement has an average of 13.22% of released CO2 molar flow less than that of parallel arrangement.","downloadable_attachments":[{"id":47261822,"asset_id":10612697,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":25930734,"first_name":"hadis","last_name":"ebrahimi","domain_name":"independent","page_name":"ebrahimihadis","display_name":"hadis ebrahimi","profile_url":"https://independent.academia.edu/ebrahimihadis?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":72,"name":"Chemical Engineering","url":"https://www.academia.edu/Documents/in/Chemical_Engineering?f_ri=223634","nofollow":false},{"id":3442,"name":"Production","url":"https://www.academia.edu/Documents/in/Production?f_ri=223634","nofollow":false},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=223634","nofollow":false},{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=223634","nofollow":false},{"id":94845,"name":"Fuel","url":"https://www.academia.edu/Documents/in/Fuel?f_ri=223634"},{"id":99038,"name":"Process Simulation","url":"https://www.academia.edu/Documents/in/Process_Simulation?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":259030,"name":"Chemical Engineering Design","url":"https://www.academia.edu/Documents/in/Chemical_Engineering_Design?f_ri=223634"},{"id":872370,"name":"Syngas","url":"https://www.academia.edu/Documents/in/Syngas?f_ri=223634"},{"id":892890,"name":"Point of View","url":"https://www.academia.edu/Documents/in/Point_of_View?f_ri=223634"},{"id":1292924,"name":"Synthesis Gas","url":"https://www.academia.edu/Documents/in/Synthesis_Gas?f_ri=223634"},{"id":1331553,"name":"Fischer Tropsch","url":"https://www.academia.edu/Documents/in/Fischer_Tropsch?f_ri=223634"},{"id":1359503,"name":"CO 2 Emission","url":"https://www.academia.edu/Documents/in/CO_2_Emission?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_46959408" data-work_id="46959408" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/46959408/EXPLORING_EXAMINATION_MALPRACTICE_INTENTION_AMONG_UNDERGRADUATES">EXPLORING EXAMINATION MALPRACTICE INTENTION AMONG UNDERGRADUATES</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Unlike several studies, which employed mostly descriptive and exploratory approaches in explaining malpractice, this study contributes to knowledge by empirically examining the malpractice phenomenon with respect to its: common... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_46959408" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Unlike several studies, which employed mostly descriptive and exploratory approaches in explaining malpractice, this study contributes to knowledge by empirically examining the malpractice phenomenon with respect to its: common manifestations, initiator and relationship with selected demographic and psychological factors. The survey involved the administration of questionnaires to a conveniently selected sample of 350 Undergraduates from three Universities (a federal, a state and a private owned University) in Edo State, Nigeria. Data obtained were analyzed using both descriptive and inferential statistics. Result obtained revealed that "Giraffing" was the commonest form of malpractice among undergraduates. Intention to engage in malpractice was found to be higher among males and students in public Universities. Level of preparation and perceived difficulty of examination were found to be the most significant psychological variables affecting intention to engage in malpractice. Curbing malpractice will therefore require Government and University authorities to strategize on managing these two variables.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/46959408" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="171b958b3cd22756cbb8ba691ab0722e" rel="nofollow" data-download="{"attachment_id":66308842,"asset_id":46959408,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/66308842/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="6659104" href="https://uniben.academia.edu/OsaigaIsibor">Osaiga F Isibor</a><script data-card-contents-for-user="6659104" type="text/json">{"id":6659104,"first_name":"Osaiga","last_name":"Isibor","domain_name":"uniben","page_name":"OsaigaIsibor","display_name":"Osaiga F Isibor","profile_url":"https://uniben.academia.edu/OsaigaIsibor?f_ri=223634","photo":"https://0.academia-photos.com/6659104/12237454/13627286/s65_osaiga.isibor.png"}</script></span></span></li><li class="js-paper-rank-work_46959408 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="46959408"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 46959408, container: ".js-paper-rank-work_46959408", }); });</script></li><li class="js-percentile-work_46959408 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 46959408; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_46959408"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_46959408 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="46959408"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 46959408; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=46959408]").text(description); $(".js-view-count-work_46959408").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_46959408").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="46959408"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">2</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="223634" href="https://www.academia.edu/Documents/in/Sorting">Sorting</a>, <script data-card-contents-for-ri="223634" type="text/json">{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="270212" href="https://www.academia.edu/Documents/in/Examination_malpractices">Examination malpractices</a><script data-card-contents-for-ri="270212" type="text/json">{"id":270212,"name":"Examination malpractices","url":"https://www.academia.edu/Documents/in/Examination_malpractices?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=46959408]'), work: {"id":46959408,"title":"EXPLORING EXAMINATION MALPRACTICE INTENTION AMONG UNDERGRADUATES","created_at":"2021-04-20T00:49:39.355-07:00","url":"https://www.academia.edu/46959408/EXPLORING_EXAMINATION_MALPRACTICE_INTENTION_AMONG_UNDERGRADUATES?f_ri=223634","dom_id":"work_46959408","summary":"Unlike several studies, which employed mostly descriptive and exploratory approaches in explaining malpractice, this study contributes to knowledge by empirically examining the malpractice phenomenon with respect to its: common manifestations, initiator and relationship with selected demographic and psychological factors. The survey involved the administration of questionnaires to a conveniently selected sample of 350 Undergraduates from three Universities (a federal, a state and a private owned University) in Edo State, Nigeria. Data obtained were analyzed using both descriptive and inferential statistics. Result obtained revealed that \"Giraffing\" was the commonest form of malpractice among undergraduates. Intention to engage in malpractice was found to be higher among males and students in public Universities. Level of preparation and perceived difficulty of examination were found to be the most significant psychological variables affecting intention to engage in malpractice. Curbing malpractice will therefore require Government and University authorities to strategize on managing these two variables.","downloadable_attachments":[{"id":66308842,"asset_id":46959408,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":6659104,"first_name":"Osaiga","last_name":"Isibor","domain_name":"uniben","page_name":"OsaigaIsibor","display_name":"Osaiga F Isibor","profile_url":"https://uniben.academia.edu/OsaigaIsibor?f_ri=223634","photo":"https://0.academia-photos.com/6659104/12237454/13627286/s65_osaiga.isibor.png"}],"research_interests":[{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634","nofollow":false},{"id":270212,"name":"Examination malpractices","url":"https://www.academia.edu/Documents/in/Examination_malpractices?f_ri=223634","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_296517" data-work_id="296517" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/296517/Staging_Queues_In_Material_Handling_and_Transportation_Systems">Staging Queues In Material Handling and Transportation Systems</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/296517" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="ff55a484e93ae317e37a67fb83ed3951" rel="nofollow" data-download="{"attachment_id":51463539,"asset_id":296517,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/51463539/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="232885" href="https://auburn.academia.edu/KevinGue">Kevin Gue</a><script data-card-contents-for-user="232885" type="text/json">{"id":232885,"first_name":"Kevin","last_name":"Gue","domain_name":"auburn","page_name":"KevinGue","display_name":"Kevin Gue","profile_url":"https://auburn.academia.edu/KevinGue?f_ri=223634","photo":"https://0.academia-photos.com/232885/51416/47359/s65_kevin.gue.jpg"}</script></span></span></li><li class="js-paper-rank-work_296517 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="296517"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 296517, container: ".js-paper-rank-work_296517", }); });</script></li><li class="js-percentile-work_296517 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 296517; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_296517"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_296517 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="296517"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 296517; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=296517]").text(description); $(".js-view-count-work_296517").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_296517").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="296517"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="10432" href="https://www.academia.edu/Documents/in/Transportation">Transportation</a>, <script data-card-contents-for-ri="10432" type="text/json">{"id":10432,"name":"Transportation","url":"https://www.academia.edu/Documents/in/Transportation?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="19816" href="https://www.academia.edu/Documents/in/Intelligent_Transport_System">Intelligent Transport System</a>, <script data-card-contents-for-ri="19816" type="text/json">{"id":19816,"name":"Intelligent Transport System","url":"https://www.academia.edu/Documents/in/Intelligent_Transport_System?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="48636" href="https://www.academia.edu/Documents/in/Simulation">Simulation</a>, <script data-card-contents-for-ri="48636" type="text/json">{"id":48636,"name":"Simulation","url":"https://www.academia.edu/Documents/in/Simulation?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="195199" href="https://www.academia.edu/Documents/in/Shipbuilding_Industry">Shipbuilding Industry</a><script data-card-contents-for-ri="195199" type="text/json">{"id":195199,"name":"Shipbuilding Industry","url":"https://www.academia.edu/Documents/in/Shipbuilding_Industry?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=296517]'), work: {"id":296517,"title":"Staging Queues In Material Handling and Transportation Systems","created_at":"2010-08-14T00:36:10.851-07:00","url":"https://www.academia.edu/296517/Staging_Queues_In_Material_Handling_and_Transportation_Systems?f_ri=223634","dom_id":"work_296517","summary":null,"downloadable_attachments":[{"id":51463539,"asset_id":296517,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":232885,"first_name":"Kevin","last_name":"Gue","domain_name":"auburn","page_name":"KevinGue","display_name":"Kevin Gue","profile_url":"https://auburn.academia.edu/KevinGue?f_ri=223634","photo":"https://0.academia-photos.com/232885/51416/47359/s65_kevin.gue.jpg"}],"research_interests":[{"id":10432,"name":"Transportation","url":"https://www.academia.edu/Documents/in/Transportation?f_ri=223634","nofollow":false},{"id":19816,"name":"Intelligent Transport System","url":"https://www.academia.edu/Documents/in/Intelligent_Transport_System?f_ri=223634","nofollow":false},{"id":48636,"name":"Simulation","url":"https://www.academia.edu/Documents/in/Simulation?f_ri=223634","nofollow":false},{"id":195199,"name":"Shipbuilding Industry","url":"https://www.academia.edu/Documents/in/Shipbuilding_Industry?f_ri=223634","nofollow":false},{"id":198557,"name":"Throughput","url":"https://www.academia.edu/Documents/in/Throughput?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":1723635,"name":"Public Policy","url":"https://www.academia.edu/Documents/in/Public_Policy?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_12014518" data-work_id="12014518" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/12014518/Composition_of_plastics_from_waste_electrical_and_electronic_equipment_WEEE_by_direct_sampling">Composition of plastics from waste electrical and electronic equipment (WEEE) by direct sampling</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/12014518" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="653b5d82e3e4e90becd7970e48cf9e7a" rel="nofollow" data-download="{"attachment_id":46403379,"asset_id":12014518,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/46403379/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="29913033" href="https://unl-pt.academia.edu/Gra%C3%A7aMartinho">Graça Martinho</a><script data-card-contents-for-user="29913033" type="text/json">{"id":29913033,"first_name":"Graça","last_name":"Martinho","domain_name":"unl-pt","page_name":"GraçaMartinho","display_name":"Graça Martinho","profile_url":"https://unl-pt.academia.edu/Gra%C3%A7aMartinho?f_ri=223634","photo":"https://0.academia-photos.com/29913033/117928162/107234842/s65_gra_a.martinho.jpeg"}</script></span></span></li><li class="js-paper-rank-work_12014518 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="12014518"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 12014518, container: ".js-paper-rank-work_12014518", }); });</script></li><li class="js-percentile-work_12014518 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 12014518; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_12014518"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_12014518 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="12014518"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 12014518; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=12014518]").text(description); $(".js-view-count-work_12014518").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_12014518").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="12014518"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">14</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="38" href="https://www.academia.edu/Documents/in/Management">Management</a>, <script data-card-contents-for-ri="38" type="text/json">{"id":38,"name":"Management","url":"https://www.academia.edu/Documents/in/Management?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="55" href="https://www.academia.edu/Documents/in/Environmental_Engineering">Environmental Engineering</a>, <script data-card-contents-for-ri="55" type="text/json">{"id":55,"name":"Environmental Engineering","url":"https://www.academia.edu/Documents/in/Environmental_Engineering?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5645" href="https://www.academia.edu/Documents/in/Recycling">Recycling</a>, <script data-card-contents-for-ri="5645" type="text/json">{"id":5645,"name":"Recycling","url":"https://www.academia.edu/Documents/in/Recycling?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="14085" href="https://www.academia.edu/Documents/in/Waste_Management">Waste Management</a><script data-card-contents-for-ri="14085" type="text/json">{"id":14085,"name":"Waste Management","url":"https://www.academia.edu/Documents/in/Waste_Management?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=12014518]'), work: {"id":12014518,"title":"Composition of plastics from waste electrical and electronic equipment (WEEE) by direct sampling","created_at":"2015-04-19T13:19:35.413-07:00","url":"https://www.academia.edu/12014518/Composition_of_plastics_from_waste_electrical_and_electronic_equipment_WEEE_by_direct_sampling?f_ri=223634","dom_id":"work_12014518","summary":null,"downloadable_attachments":[{"id":46403379,"asset_id":12014518,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":29913033,"first_name":"Graça","last_name":"Martinho","domain_name":"unl-pt","page_name":"GraçaMartinho","display_name":"Graça Martinho","profile_url":"https://unl-pt.academia.edu/Gra%C3%A7aMartinho?f_ri=223634","photo":"https://0.academia-photos.com/29913033/117928162/107234842/s65_gra_a.martinho.jpeg"}],"research_interests":[{"id":38,"name":"Management","url":"https://www.academia.edu/Documents/in/Management?f_ri=223634","nofollow":false},{"id":55,"name":"Environmental Engineering","url":"https://www.academia.edu/Documents/in/Environmental_Engineering?f_ri=223634","nofollow":false},{"id":5645,"name":"Recycling","url":"https://www.academia.edu/Documents/in/Recycling?f_ri=223634","nofollow":false},{"id":14085,"name":"Waste Management","url":"https://www.academia.edu/Documents/in/Waste_Management?f_ri=223634","nofollow":false},{"id":44510,"name":"Portugal","url":"https://www.academia.edu/Documents/in/Portugal?f_ri=223634"},{"id":88353,"name":"Processing","url":"https://www.academia.edu/Documents/in/Processing?f_ri=223634"},{"id":104708,"name":"Plastics","url":"https://www.academia.edu/Documents/in/Plastics?f_ri=223634"},{"id":118213,"name":"Electronic waste","url":"https://www.academia.edu/Documents/in/Electronic_waste?f_ri=223634"},{"id":151662,"name":"Additives","url":"https://www.academia.edu/Documents/in/Additives?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":1197055,"name":"Polypropylenes","url":"https://www.academia.edu/Documents/in/Polypropylenes?f_ri=223634"},{"id":1281441,"name":"Electrical Equipment","url":"https://www.academia.edu/Documents/in/Electrical_Equipment?f_ri=223634"},{"id":1512512,"name":"Styrene","url":"https://www.academia.edu/Documents/in/Styrene?f_ri=223634"},{"id":2230203,"name":"Acrylonitrile","url":"https://www.academia.edu/Documents/in/Acrylonitrile?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_10074148" data-work_id="10074148" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/10074148/Multiobjective_optimization_of_an_industrial_styrene_reactor">Multiobjective optimization of an industrial styrene reactor</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/10074148" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="5ef68357064a660a143f26f008bab24b" rel="nofollow" data-download="{"attachment_id":47544868,"asset_id":10074148,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47544868/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="24536229" href="https://westernu.academia.edu/AjayRay">Ajay Ray</a><script data-card-contents-for-user="24536229" type="text/json">{"id":24536229,"first_name":"Ajay","last_name":"Ray","domain_name":"westernu","page_name":"AjayRay","display_name":"Ajay Ray","profile_url":"https://westernu.academia.edu/AjayRay?f_ri=223634","photo":"https://0.academia-photos.com/24536229/6626702/7489853/s65_ajay.ray.jpg_oh_c3cc3867bd029b34b815c662c4a88cc9_oe_5535f12f___gda___1429312710_b445e08d44a98540f2b5fdf48eb1ea6f"}</script></span></span></li><li class="js-paper-rank-work_10074148 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="10074148"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 10074148, container: ".js-paper-rank-work_10074148", }); });</script></li><li class="js-percentile-work_10074148 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 10074148; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_10074148"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_10074148 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="10074148"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 10074148; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=10074148]").text(description); $(".js-view-count-work_10074148").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_10074148").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="10074148"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">25</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="60" href="https://www.academia.edu/Documents/in/Mechanical_Engineering">Mechanical Engineering</a>, <script data-card-contents-for-ri="60" type="text/json">{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="72" href="https://www.academia.edu/Documents/in/Chemical_Engineering">Chemical Engineering</a>, <script data-card-contents-for-ri="72" type="text/json">{"id":72,"name":"Chemical Engineering","url":"https://www.academia.edu/Documents/in/Chemical_Engineering?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="988" href="https://www.academia.edu/Documents/in/Design">Design</a>, <script data-card-contents-for-ri="988" type="text/json">{"id":988,"name":"Design","url":"https://www.academia.edu/Documents/in/Design?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5442" href="https://www.academia.edu/Documents/in/Process_Systems_Engineering">Process Systems Engineering</a><script data-card-contents-for-ri="5442" type="text/json">{"id":5442,"name":"Process Systems Engineering","url":"https://www.academia.edu/Documents/in/Process_Systems_Engineering?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=10074148]'), work: {"id":10074148,"title":"Multiobjective optimization of an industrial styrene reactor","created_at":"2015-01-08T10:10:43.964-08:00","url":"https://www.academia.edu/10074148/Multiobjective_optimization_of_an_industrial_styrene_reactor?f_ri=223634","dom_id":"work_10074148","summary":null,"downloadable_attachments":[{"id":47544868,"asset_id":10074148,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":24536229,"first_name":"Ajay","last_name":"Ray","domain_name":"westernu","page_name":"AjayRay","display_name":"Ajay Ray","profile_url":"https://westernu.academia.edu/AjayRay?f_ri=223634","photo":"https://0.academia-photos.com/24536229/6626702/7489853/s65_ajay.ray.jpg_oh_c3cc3867bd029b34b815c662c4a88cc9_oe_5535f12f___gda___1429312710_b445e08d44a98540f2b5fdf48eb1ea6f"}],"research_interests":[{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=223634","nofollow":false},{"id":72,"name":"Chemical Engineering","url":"https://www.academia.edu/Documents/in/Chemical_Engineering?f_ri=223634","nofollow":false},{"id":988,"name":"Design","url":"https://www.academia.edu/Documents/in/Design?f_ri=223634","nofollow":false},{"id":5442,"name":"Process Systems Engineering","url":"https://www.academia.edu/Documents/in/Process_Systems_Engineering?f_ri=223634","nofollow":false},{"id":13445,"name":"Multiobjective Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Optimization?f_ri=223634"},{"id":17320,"name":"Reaction engineering","url":"https://www.academia.edu/Documents/in/Reaction_engineering?f_ri=223634"},{"id":19517,"name":"Heat Exchanger","url":"https://www.academia.edu/Documents/in/Heat_Exchanger?f_ri=223634"},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=223634"},{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=223634"},{"id":48636,"name":"Simulation","url":"https://www.academia.edu/Documents/in/Simulation?f_ri=223634"},{"id":57518,"name":"Conception","url":"https://www.academia.edu/Documents/in/Conception?f_ri=223634"},{"id":99038,"name":"Process Simulation","url":"https://www.academia.edu/Documents/in/Process_Simulation?f_ri=223634"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=223634"},{"id":152553,"name":"Comparative Analysis","url":"https://www.academia.edu/Documents/in/Comparative_Analysis?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":327320,"name":"Chemical reactors","url":"https://www.academia.edu/Documents/in/Chemical_reactors?f_ri=223634"},{"id":357520,"name":"Non-dominated Sorting Genetic Algorithm-II (NSGA-II)","url":"https://www.academia.edu/Documents/in/Non-dominated_Sorting_Genetic_Algorithm-II_NSGA-II_?f_ri=223634"},{"id":477865,"name":"Operant Conditioning","url":"https://www.academia.edu/Documents/in/Operant_Conditioning?f_ri=223634"},{"id":512384,"name":"Chemical Reaction Engineering and Reactor Analysis","url":"https://www.academia.edu/Documents/in/Chemical_Reaction_Engineering_and_Reactor_Analysis?f_ri=223634"},{"id":552191,"name":"Reactor","url":"https://www.academia.edu/Documents/in/Reactor?f_ri=223634"},{"id":595175,"name":"Chemical Engineering Science","url":"https://www.academia.edu/Documents/in/Chemical_Engineering_Science?f_ri=223634"},{"id":898062,"name":"Flow Rate","url":"https://www.academia.edu/Documents/in/Flow_Rate?f_ri=223634"},{"id":1032348,"name":"Pareto Optimality","url":"https://www.academia.edu/Documents/in/Pareto_Optimality?f_ri=223634"},{"id":1191377,"name":"Water Vapor","url":"https://www.academia.edu/Documents/in/Water_Vapor?f_ri=223634"},{"id":2421822,"name":"Objective function","url":"https://www.academia.edu/Documents/in/Objective_function?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_8797967" data-work_id="8797967" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/8797967/Three_in_One_Sorting_Algorithm">Three-in-One Sorting Algorithm</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/8797967" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d823c1ff662a9658fa6cd8aca23b3600" rel="nofollow" data-download="{"attachment_id":35146028,"asset_id":8797967,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/35146028/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="19043881" href="https://kau.academia.edu/DRKhalidThabit">DR. Khalid Thabit</a><script data-card-contents-for-user="19043881" type="text/json">{"id":19043881,"first_name":"DR. Khalid","last_name":"Thabit","domain_name":"kau","page_name":"DRKhalidThabit","display_name":"DR. Khalid Thabit","profile_url":"https://kau.academia.edu/DRKhalidThabit?f_ri=223634","photo":"https://0.academia-photos.com/19043881/5354157/6113696/s65_dr._khalid.thabit.jpg"}</script></span></span></li><li class="js-paper-rank-work_8797967 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="8797967"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 8797967, container: ".js-paper-rank-work_8797967", }); });</script></li><li class="js-percentile-work_8797967 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 8797967; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_8797967"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_8797967 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="8797967"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 8797967; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=8797967]").text(description); $(".js-view-count-work_8797967").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_8797967").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="8797967"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">15</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="146" href="https://www.academia.edu/Documents/in/Bioinformatics">Bioinformatics</a>, <script data-card-contents-for-ri="146" type="text/json">{"id":146,"name":"Bioinformatics","url":"https://www.academia.edu/Documents/in/Bioinformatics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="428" href="https://www.academia.edu/Documents/in/Algorithms">Algorithms</a>, <script data-card-contents-for-ri="428" type="text/json">{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="442" href="https://www.academia.edu/Documents/in/Parallel_Computing">Parallel Computing</a>, <script data-card-contents-for-ri="442" type="text/json">{"id":442,"name":"Parallel Computing","url":"https://www.academia.edu/Documents/in/Parallel_Computing?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="451" href="https://www.academia.edu/Documents/in/Programming_Languages">Programming Languages</a><script data-card-contents-for-ri="451" type="text/json">{"id":451,"name":"Programming Languages","url":"https://www.academia.edu/Documents/in/Programming_Languages?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=8797967]'), work: {"id":8797967,"title":"Three-in-One Sorting Algorithm","created_at":"2014-10-15T10:55:48.842-07:00","url":"https://www.academia.edu/8797967/Three_in_One_Sorting_Algorithm?f_ri=223634","dom_id":"work_8797967","summary":null,"downloadable_attachments":[{"id":35146028,"asset_id":8797967,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":19043881,"first_name":"DR. Khalid","last_name":"Thabit","domain_name":"kau","page_name":"DRKhalidThabit","display_name":"DR. Khalid Thabit","profile_url":"https://kau.academia.edu/DRKhalidThabit?f_ri=223634","photo":"https://0.academia-photos.com/19043881/5354157/6113696/s65_dr._khalid.thabit.jpg"}],"research_interests":[{"id":146,"name":"Bioinformatics","url":"https://www.academia.edu/Documents/in/Bioinformatics?f_ri=223634","nofollow":false},{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=223634","nofollow":false},{"id":442,"name":"Parallel Computing","url":"https://www.academia.edu/Documents/in/Parallel_Computing?f_ri=223634","nofollow":false},{"id":451,"name":"Programming Languages","url":"https://www.academia.edu/Documents/in/Programming_Languages?f_ri=223634","nofollow":false},{"id":1128,"name":"Computer Science Education","url":"https://www.academia.edu/Documents/in/Computer_Science_Education?f_ri=223634"},{"id":2008,"name":"Machine Learning","url":"https://www.academia.edu/Documents/in/Machine_Learning?f_ri=223634"},{"id":2722,"name":"Arabic Language and Linguistics","url":"https://www.academia.edu/Documents/in/Arabic_Language_and_Linguistics?f_ri=223634"},{"id":4672,"name":"Open Source Software","url":"https://www.academia.edu/Documents/in/Open_Source_Software?f_ri=223634"},{"id":6402,"name":"Data Compression","url":"https://www.academia.edu/Documents/in/Data_Compression?f_ri=223634"},{"id":10924,"name":"Optimization techniques","url":"https://www.academia.edu/Documents/in/Optimization_techniques?f_ri=223634"},{"id":17167,"name":"Parallel Processing","url":"https://www.academia.edu/Documents/in/Parallel_Processing?f_ri=223634"},{"id":26860,"name":"Cloud Computing","url":"https://www.academia.edu/Documents/in/Cloud_Computing?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":347625,"name":"Text to Speech","url":"https://www.academia.edu/Documents/in/Text_to_Speech?f_ri=223634"},{"id":1321258,"name":"Quicksort","url":"https://www.academia.edu/Documents/in/Quicksort?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_41208856" data-work_id="41208856" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/41208856/Sarah_Przybyl_Qui_veut_encore_prot%C3%A9ger_les_mineurs_non_accompagn%C3%A9s_en_France_De_l_accueil_inconditionnel_d_enfants_en_danger_%C3%A0_la_sous_traitance_du_contr%C3%B4le_d_%C3%A9trangers_ind%C3%A9sirables">Sarah Przybyl - Qui veut encore protéger les mineurs non accompagnés en France ? De l’accueil inconditionnel d’enfants en danger à la sous-traitance du contrôle d’étrangers indésirables</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Arrivés dans le courant des années 1990, les mineurs non accompagnés sont des individus de moins de 18 ans qui, après un parcours migratoire, se trouvent sur le territoire français sans leur représentant légal. Enfants en danger devant... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_41208856" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Arrivés dans le courant des années 1990, les mineurs non accompagnés sont des individus de moins de 18 ans qui, après un parcours migratoire, se trouvent sur le territoire français sans leur représentant légal. Enfants en danger devant être pris en charge inconditionnellement par les services départementaux compétents, pourquoi ces mineurs sont-ils devenus les objets d’une politique du tri et du contrôle ? Comment ces considérations ont-elles pu s’inviter dans le champ de la protection de l’enfance ? Qui sont les acteurs impliqués dans ce basculement du parcours dédié aux mineurs non accompagnés ? Mineurs à protéger d’un côté et étrangers à contrôler de l’autre, cette population est perçue à travers des représentations bipolaires qui ont conduit à l’édification de frontières administratives, institutionnelles et symboliques jalonnant aujourd’hui le parcours de l’accueil de ces jeunes. Alors que leur minorité et leur isolement devraient suffire à justifier une prise en charge, le soupçon qui plane sur ces jeunes a fait de ces deux critères des données scrupuleusement vérifiées par les autorités. La contribution revient sur la logique de sous-traitance de la mission d’évaluation et de mise à l’abri ayant permis d’exclure ces mineurs du circuit traditionnel de la protection de l’enfance. Associations, organisations humanitaires, société civile, ministère de la Justice incarnent les nouveaux protagonistes d’un paysage de l’accueil, où les idéaux et les engagements en matière de défense du droit des enfants ont été relégués au second plan.<br /><br />Mots-clés : mineurs non accompagnés, sous-traitance, protection de l’enfance, politique migratoire, discrimination, associations, contrôle, tri<br /><br />Arrived in the course of the 1990s, unaccompanied minors are individuals under 18 who, after a migratory journey, are on French territory without their legal representative. Children at risk to be cared for unconditionally by the relevant departmental services, why these minors have become the objects of a policy of sorting and control? How could these considerations have been invoked in the field of child protection? Who are the actors involved in this changeover of the path dedicated to unaccompanied minors? Minors to protect on one side and foreigners to control on the other, the bipolarity of representations that surrounds this population has led to the construction of administrative, institutional and symbolic boundaries that today mark the course of the reception of these youth. While their minority and their isolation should be sufficient to justify a care, the suspicion that hangs over these young people made these two criteria data scrupulously verified by the authorities. The contribution goes back to the logic of subcontracting the evaluation and shelter mission which made it possible to exclude these minors from the traditional circuit of child protection. Associations, humanitarian organizations, civil society, the Ministry of Justice, embody the new protagonists of a welcoming landscape where ideals and commitments to the defense of the rights of children have been relegated to the background.<br /><br />Keywords: unaccompanied minors, subcontracting, child protection, migration policy, discrimination, associations, control, sorting</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/41208856" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c58fda067d73b329915da72214c5b04e" rel="nofollow" data-download="{"attachment_id":61446049,"asset_id":41208856,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/61446049/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="56871304" href="https://inrs.academia.edu/LiensocialetPolitiques">Lien social et Politiques</a><script data-card-contents-for-user="56871304" type="text/json">{"id":56871304,"first_name":"Lien social","last_name":"et Politiques","domain_name":"inrs","page_name":"LiensocialetPolitiques","display_name":"Lien social et Politiques","profile_url":"https://inrs.academia.edu/LiensocialetPolitiques?f_ri=223634","photo":"https://0.academia-photos.com/56871304/14945838/15701862/s65_lien_social.et_politiques.jpg"}</script></span></span></li><li class="js-paper-rank-work_41208856 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="41208856"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 41208856, container: ".js-paper-rank-work_41208856", }); });</script></li><li class="js-percentile-work_41208856 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 41208856; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_41208856"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_41208856 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="41208856"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 41208856; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=41208856]").text(description); $(".js-view-count-work_41208856").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_41208856").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="41208856"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">14</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2567" href="https://www.academia.edu/Documents/in/Child_protection">Child protection</a>, <script data-card-contents-for-ri="2567" type="text/json">{"id":2567,"name":"Child protection","url":"https://www.academia.edu/Documents/in/Child_protection?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="6942" href="https://www.academia.edu/Documents/in/Discrimination">Discrimination</a>, <script data-card-contents-for-ri="6942" type="text/json">{"id":6942,"name":"Discrimination","url":"https://www.academia.edu/Documents/in/Discrimination?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="7523" href="https://www.academia.edu/Documents/in/Control">Control</a>, <script data-card-contents-for-ri="7523" type="text/json">{"id":7523,"name":"Control","url":"https://www.academia.edu/Documents/in/Control?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="136246" href="https://www.academia.edu/Documents/in/Subcontracting">Subcontracting</a><script data-card-contents-for-ri="136246" type="text/json">{"id":136246,"name":"Subcontracting","url":"https://www.academia.edu/Documents/in/Subcontracting?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=41208856]'), work: {"id":41208856,"title":"Sarah Przybyl - Qui veut encore protéger les mineurs non accompagnés en France ? De l’accueil inconditionnel d’enfants en danger à la sous-traitance du contrôle d’étrangers indésirables","created_at":"2019-12-06T19:23:46.124-08:00","url":"https://www.academia.edu/41208856/Sarah_Przybyl_Qui_veut_encore_prot%C3%A9ger_les_mineurs_non_accompagn%C3%A9s_en_France_De_l_accueil_inconditionnel_d_enfants_en_danger_%C3%A0_la_sous_traitance_du_contr%C3%B4le_d_%C3%A9trangers_ind%C3%A9sirables?f_ri=223634","dom_id":"work_41208856","summary":"Arrivés dans le courant des années 1990, les mineurs non accompagnés sont des individus de moins de 18 ans qui, après un parcours migratoire, se trouvent sur le territoire français sans leur représentant légal. Enfants en danger devant être pris en charge inconditionnellement par les services départementaux compétents, pourquoi ces mineurs sont-ils devenus les objets d’une politique du tri et du contrôle ? Comment ces considérations ont-elles pu s’inviter dans le champ de la protection de l’enfance ? Qui sont les acteurs impliqués dans ce basculement du parcours dédié aux mineurs non accompagnés ? Mineurs à protéger d’un côté et étrangers à contrôler de l’autre, cette population est perçue à travers des représentations bipolaires qui ont conduit à l’édification de frontières administratives, institutionnelles et symboliques jalonnant aujourd’hui le parcours de l’accueil de ces jeunes. Alors que leur minorité et leur isolement devraient suffire à justifier une prise en charge, le soupçon qui plane sur ces jeunes a fait de ces deux critères des données scrupuleusement vérifiées par les autorités. La contribution revient sur la logique de sous-traitance de la mission d’évaluation et de mise à l’abri ayant permis d’exclure ces mineurs du circuit traditionnel de la protection de l’enfance. Associations, organisations humanitaires, société civile, ministère de la Justice incarnent les nouveaux protagonistes d’un paysage de l’accueil, où les idéaux et les engagements en matière de défense du droit des enfants ont été relégués au second plan.\n\nMots-clés : mineurs non accompagnés, sous-traitance, protection de l’enfance, politique migratoire, discrimination, associations, contrôle, tri\n\nArrived in the course of the 1990s, unaccompanied minors are individuals under 18 who, after a migratory journey, are on French territory without their legal representative. Children at risk to be cared for unconditionally by the relevant departmental services, why these minors have become the objects of a policy of sorting and control? How could these considerations have been invoked in the field of child protection? Who are the actors involved in this changeover of the path dedicated to unaccompanied minors? Minors to protect on one side and foreigners to control on the other, the bipolarity of representations that surrounds this population has led to the construction of administrative, institutional and symbolic boundaries that today mark the course of the reception of these youth. While their minority and their isolation should be sufficient to justify a care, the suspicion that hangs over these young people made these two criteria data scrupulously verified by the authorities. The contribution goes back to the logic of subcontracting the evaluation and shelter mission which made it possible to exclude these minors from the traditional circuit of child protection. Associations, humanitarian organizations, civil society, the Ministry of Justice, embody the new protagonists of a welcoming landscape where ideals and commitments to the defense of the rights of children have been relegated to the background.\n\nKeywords: unaccompanied minors, subcontracting, child protection, migration policy, discrimination, associations, control, sorting","downloadable_attachments":[{"id":61446049,"asset_id":41208856,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":56871304,"first_name":"Lien social","last_name":"et Politiques","domain_name":"inrs","page_name":"LiensocialetPolitiques","display_name":"Lien social et Politiques","profile_url":"https://inrs.academia.edu/LiensocialetPolitiques?f_ri=223634","photo":"https://0.academia-photos.com/56871304/14945838/15701862/s65_lien_social.et_politiques.jpg"}],"research_interests":[{"id":2567,"name":"Child protection","url":"https://www.academia.edu/Documents/in/Child_protection?f_ri=223634","nofollow":false},{"id":6942,"name":"Discrimination","url":"https://www.academia.edu/Documents/in/Discrimination?f_ri=223634","nofollow":false},{"id":7523,"name":"Control","url":"https://www.academia.edu/Documents/in/Control?f_ri=223634","nofollow":false},{"id":136246,"name":"Subcontracting","url":"https://www.academia.edu/Documents/in/Subcontracting?f_ri=223634","nofollow":false},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":228915,"name":"Unaccompanied Refugee Minors","url":"https://www.academia.edu/Documents/in/Unaccompanied_Refugee_Minors?f_ri=223634"},{"id":256613,"name":"Migration Policy","url":"https://www.academia.edu/Documents/in/Migration_Policy?f_ri=223634"},{"id":334622,"name":"Contrôle","url":"https://www.academia.edu/Documents/in/Contr%C3%B4le?f_ri=223634"},{"id":357580,"name":"Associations","url":"https://www.academia.edu/Documents/in/Associations?f_ri=223634"},{"id":742021,"name":"Tri","url":"https://www.academia.edu/Documents/in/Tri?f_ri=223634"},{"id":1251561,"name":"Protection De L'enfance","url":"https://www.academia.edu/Documents/in/Protection_De_Lenfance?f_ri=223634"},{"id":2549878,"name":"Politiques migratoires","url":"https://www.academia.edu/Documents/in/Politiques_migratoires?f_ri=223634"},{"id":3137922,"name":"Mineurs Non Accompagnés","url":"https://www.academia.edu/Documents/in/Mineurs_Non_Accompagn%C3%A9s?f_ri=223634"},{"id":3179098,"name":"Sous-Traitance","url":"https://www.academia.edu/Documents/in/Sous-Traitance?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_14809453" data-work_id="14809453" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/14809453/The_Retromer_Coat_Complex_Coordinates_Endosomal_Sorting_and_Dynein_Mediated_Transport_with_Carrier_Recognition_by_the_trans_Golgi_Network">The Retromer Coat Complex Coordinates Endosomal Sorting and Dynein-Mediated Transport, with Carrier Recognition by the trans-Golgi Network</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/14809453" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="8194156e5fc7a30687614ee0dcf3855e" rel="nofollow" data-download="{"attachment_id":43882000,"asset_id":14809453,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/43882000/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="33769363" href="https://curie.academia.edu/BrunoGoud">Bruno Goud</a><script data-card-contents-for-user="33769363" type="text/json">{"id":33769363,"first_name":"Bruno","last_name":"Goud","domain_name":"curie","page_name":"BrunoGoud","display_name":"Bruno Goud","profile_url":"https://curie.academia.edu/BrunoGoud?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_14809453 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="14809453"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 14809453, container: ".js-paper-rank-work_14809453", }); });</script></li><li class="js-percentile-work_14809453 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 14809453; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_14809453"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_14809453 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="14809453"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 14809453; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=14809453]").text(description); $(".js-view-count-work_14809453").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_14809453").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="14809453"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="156" href="https://www.academia.edu/Documents/in/Genetics">Genetics</a>, <script data-card-contents-for-ri="156" type="text/json">{"id":156,"name":"Genetics","url":"https://www.academia.edu/Documents/in/Genetics?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2889" href="https://www.academia.edu/Documents/in/Caenorhabditis_elegans">Caenorhabditis elegans</a>, <script data-card-contents-for-ri="2889" type="text/json">{"id":2889,"name":"Caenorhabditis elegans","url":"https://www.academia.edu/Documents/in/Caenorhabditis_elegans?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="47884" href="https://www.academia.edu/Documents/in/Biological_Sciences">Biological Sciences</a>, <script data-card-contents-for-ri="47884" type="text/json">{"id":47884,"name":"Biological Sciences","url":"https://www.academia.edu/Documents/in/Biological_Sciences?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="51121" href="https://www.academia.edu/Documents/in/RNA_interference">RNA interference</a><script data-card-contents-for-ri="51121" type="text/json">{"id":51121,"name":"RNA interference","url":"https://www.academia.edu/Documents/in/RNA_interference?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=14809453]'), work: {"id":14809453,"title":"The Retromer Coat Complex Coordinates Endosomal Sorting and Dynein-Mediated Transport, with Carrier Recognition by the trans-Golgi Network","created_at":"2015-08-09T23:25:05.440-07:00","url":"https://www.academia.edu/14809453/The_Retromer_Coat_Complex_Coordinates_Endosomal_Sorting_and_Dynein_Mediated_Transport_with_Carrier_Recognition_by_the_trans_Golgi_Network?f_ri=223634","dom_id":"work_14809453","summary":null,"downloadable_attachments":[{"id":43882000,"asset_id":14809453,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":33769363,"first_name":"Bruno","last_name":"Goud","domain_name":"curie","page_name":"BrunoGoud","display_name":"Bruno Goud","profile_url":"https://curie.academia.edu/BrunoGoud?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":156,"name":"Genetics","url":"https://www.academia.edu/Documents/in/Genetics?f_ri=223634","nofollow":false},{"id":2889,"name":"Caenorhabditis elegans","url":"https://www.academia.edu/Documents/in/Caenorhabditis_elegans?f_ri=223634","nofollow":false},{"id":47884,"name":"Biological Sciences","url":"https://www.academia.edu/Documents/in/Biological_Sciences?f_ri=223634","nofollow":false},{"id":51121,"name":"RNA interference","url":"https://www.academia.edu/Documents/in/RNA_interference?f_ri=223634","nofollow":false},{"id":54433,"name":"Phylogeny","url":"https://www.academia.edu/Documents/in/Phylogeny?f_ri=223634"},{"id":57808,"name":"Cell line","url":"https://www.academia.edu/Documents/in/Cell_line?f_ri=223634"},{"id":149836,"name":"Spatial Organization","url":"https://www.academia.edu/Documents/in/Spatial_Organization?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":743709,"name":"Protein isoforms","url":"https://www.academia.edu/Documents/in/Protein_isoforms?f_ri=223634"},{"id":1032494,"name":"Carrier","url":"https://www.academia.edu/Documents/in/Carrier?f_ri=223634"},{"id":1254280,"name":"Endosomes","url":"https://www.academia.edu/Documents/in/Endosomes?f_ri=223634"},{"id":1393770,"name":"Molecular Motor","url":"https://www.academia.edu/Documents/in/Molecular_Motor?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_29991443" data-work_id="29991443" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/29991443/Soft_ELECTRE_TRI_outranking_method_based_on_belief_functions">Soft ELECTRE TRI outranking method based on belief functions</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/29991443" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="4b148cf2538bffb9260f83cbc0e4ab99" rel="nofollow" data-download="{"attachment_id":50450194,"asset_id":29991443,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50450194/download_file?st=MTczMjgxMTk4Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="56979817" href="https://independent.academia.edu/JeanMarcTacnet">Jean-Marc Tacnet</a><script data-card-contents-for-user="56979817" type="text/json">{"id":56979817,"first_name":"Jean-Marc","last_name":"Tacnet","domain_name":"independent","page_name":"JeanMarcTacnet","display_name":"Jean-Marc Tacnet","profile_url":"https://independent.academia.edu/JeanMarcTacnet?f_ri=223634","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_29991443 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="29991443"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 29991443, container: ".js-paper-rank-work_29991443", }); });</script></li><li class="js-percentile-work_29991443 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 29991443; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_29991443"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_29991443 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="29991443"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 29991443; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=29991443]").text(description); $(".js-view-count-work_29991443").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_29991443").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="29991443"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="2535" href="https://www.academia.edu/Documents/in/Operations_Research">Operations Research</a>, <script data-card-contents-for-ri="2535" type="text/json">{"id":2535,"name":"Operations Research","url":"https://www.academia.edu/Documents/in/Operations_Research?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2950" href="https://www.academia.edu/Documents/in/Computational_Modeling">Computational Modeling</a>, <script data-card-contents-for-ri="2950" type="text/json">{"id":2950,"name":"Computational Modeling","url":"https://www.academia.edu/Documents/in/Computational_Modeling?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="25660" href="https://www.academia.edu/Documents/in/Decision_Theory">Decision Theory</a>, <script data-card-contents-for-ri="25660" type="text/json">{"id":25660,"name":"Decision Theory","url":"https://www.academia.edu/Documents/in/Decision_Theory?f_ri=223634","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="33069" href="https://www.academia.edu/Documents/in/Probability">Probability</a><script data-card-contents-for-ri="33069" type="text/json">{"id":33069,"name":"Probability","url":"https://www.academia.edu/Documents/in/Probability?f_ri=223634","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=29991443]'), work: {"id":29991443,"title":"Soft ELECTRE TRI outranking method based on belief functions","created_at":"2016-11-21T00:16:10.813-08:00","url":"https://www.academia.edu/29991443/Soft_ELECTRE_TRI_outranking_method_based_on_belief_functions?f_ri=223634","dom_id":"work_29991443","summary":null,"downloadable_attachments":[{"id":50450194,"asset_id":29991443,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":56979817,"first_name":"Jean-Marc","last_name":"Tacnet","domain_name":"independent","page_name":"JeanMarcTacnet","display_name":"Jean-Marc Tacnet","profile_url":"https://independent.academia.edu/JeanMarcTacnet?f_ri=223634","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2535,"name":"Operations Research","url":"https://www.academia.edu/Documents/in/Operations_Research?f_ri=223634","nofollow":false},{"id":2950,"name":"Computational Modeling","url":"https://www.academia.edu/Documents/in/Computational_Modeling?f_ri=223634","nofollow":false},{"id":25660,"name":"Decision Theory","url":"https://www.academia.edu/Documents/in/Decision_Theory?f_ri=223634","nofollow":false},{"id":33069,"name":"Probability","url":"https://www.academia.edu/Documents/in/Probability?f_ri=223634","nofollow":false},{"id":61603,"name":"Uncertainty","url":"https://www.academia.edu/Documents/in/Uncertainty?f_ri=223634"},{"id":223634,"name":"Sorting","url":"https://www.academia.edu/Documents/in/Sorting?f_ri=223634"},{"id":1006047,"name":"Indexes","url":"https://www.academia.edu/Documents/in/Indexes?f_ri=223634"}]}, }) } })();</script></ul></li></ul></div></div></div><div class="u-taCenter Pagination"><ul class="pagination"><li class="next_page"><a href="/Documents/in/Sorting?after=50%2C29991443" rel="next">Next</a></li><li class="last next"><a href="/Documents/in/Sorting?page=last">Last »</a></li></ul></div></div><div class="hidden-xs hidden-sm"><div class="u-pl6x"><div style="width: 300px;"><div class="panel panel-flat u-mt7x"><div class="panel-heading u-p5x"><div class="u-tcGrayDark u-taCenter u-fw700 u-textUppercase">Related Topics</div></div><ul class="list-group"><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Bubble">Bubble</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="152114">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="152114">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Quick">Quick</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="304264">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="304264">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Methods">Methods</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="54344">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="54344">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Communication">Communication</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="859">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="859">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Thresholding">Thresholding</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="155948">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="155948">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/ECG_Signal_processing">ECG Signal processing</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="152880">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="152880">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Biomedical_signal_and_image_processing">Biomedical signal and image processing</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="15811">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="15811">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Sorting_Algorithm">Sorting Algorithm</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="585882">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="585882">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Biomedical_Engineering">Biomedical Engineering</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="1131">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="1131">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Bubble_Sort">Bubble Sort</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="1218098">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="1218098">Following</a></div></li></ul></div></div></div></div></div></div><script>// MIT License // Copyright © 2011 Sebastian Tschan, https://blueimp.net // Permission is hereby granted, free of charge, to any person obtaining a copy of // this software and associated documentation files (the "Software"), to deal in // the Software without restriction, including without limitation the rights to // use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of // the Software, and to permit persons to whom the Software is furnished to do so, // subject to the following conditions: // The above copyright notice and this permission notice shall be included in all // copies or substantial portions of the Software. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS // FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR // COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN // CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. !function(n){"use strict";function d(n,t){var r=(65535&n)+(65535&t);return(n>>16)+(t>>16)+(r>>16)<<16|65535&r}function f(n,t,r,e,o,u){return d((c=d(d(t,n),d(e,u)))<<(f=o)|c>>>32-f,r);var c,f}function l(n,t,r,e,o,u,c){return f(t&r|~t&e,n,t,o,u,c)}function v(n,t,r,e,o,u,c){return f(t&e|r&~e,n,t,o,u,c)}function g(n,t,r,e,o,u,c){return f(t^r^e,n,t,o,u,c)}function m(n,t,r,e,o,u,c){return f(r^(t|~e),n,t,o,u,c)}function i(n,t){var r,e,o,u;n[t>>5]|=128<<t%32,n[14+(t+64>>>9<<4)]=t;for(var c=1732584193,f=-271733879,i=-1732584194,a=271733878,h=0;h<n.length;h+=16)c=l(r=c,e=f,o=i,u=a,n[h],7,-680876936),a=l(a,c,f,i,n[h+1],12,-389564586),i=l(i,a,c,f,n[h+2],17,606105819),f=l(f,i,a,c,n[h+3],22,-1044525330),c=l(c,f,i,a,n[h+4],7,-176418897),a=l(a,c,f,i,n[h+5],12,1200080426),i=l(i,a,c,f,n[h+6],17,-1473231341),f=l(f,i,a,c,n[h+7],22,-45705983),c=l(c,f,i,a,n[h+8],7,1770035416),a=l(a,c,f,i,n[h+9],12,-1958414417),i=l(i,a,c,f,n[h+10],17,-42063),f=l(f,i,a,c,n[h+11],22,-1990404162),c=l(c,f,i,a,n[h+12],7,1804603682),a=l(a,c,f,i,n[h+13],12,-40341101),i=l(i,a,c,f,n[h+14],17,-1502002290),c=v(c,f=l(f,i,a,c,n[h+15],22,1236535329),i,a,n[h+1],5,-165796510),a=v(a,c,f,i,n[h+6],9,-1069501632),i=v(i,a,c,f,n[h+11],14,643717713),f=v(f,i,a,c,n[h],20,-373897302),c=v(c,f,i,a,n[h+5],5,-701558691),a=v(a,c,f,i,n[h+10],9,38016083),i=v(i,a,c,f,n[h+15],14,-660478335),f=v(f,i,a,c,n[h+4],20,-405537848),c=v(c,f,i,a,n[h+9],5,568446438),a=v(a,c,f,i,n[h+14],9,-1019803690),i=v(i,a,c,f,n[h+3],14,-187363961),f=v(f,i,a,c,n[h+8],20,1163531501),c=v(c,f,i,a,n[h+13],5,-1444681467),a=v(a,c,f,i,n[h+2],9,-51403784),i=v(i,a,c,f,n[h+7],14,1735328473),c=g(c,f=v(f,i,a,c,n[h+12],20,-1926607734),i,a,n[h+5],4,-378558),a=g(a,c,f,i,n[h+8],11,-2022574463),i=g(i,a,c,f,n[h+11],16,1839030562),f=g(f,i,a,c,n[h+14],23,-35309556),c=g(c,f,i,a,n[h+1],4,-1530992060),a=g(a,c,f,i,n[h+4],11,1272893353),i=g(i,a,c,f,n[h+7],16,-155497632),f=g(f,i,a,c,n[h+10],23,-1094730640),c=g(c,f,i,a,n[h+13],4,681279174),a=g(a,c,f,i,n[h],11,-358537222),i=g(i,a,c,f,n[h+3],16,-722521979),f=g(f,i,a,c,n[h+6],23,76029189),c=g(c,f,i,a,n[h+9],4,-640364487),a=g(a,c,f,i,n[h+12],11,-421815835),i=g(i,a,c,f,n[h+15],16,530742520),c=m(c,f=g(f,i,a,c,n[h+2],23,-995338651),i,a,n[h],6,-198630844),a=m(a,c,f,i,n[h+7],10,1126891415),i=m(i,a,c,f,n[h+14],15,-1416354905),f=m(f,i,a,c,n[h+5],21,-57434055),c=m(c,f,i,a,n[h+12],6,1700485571),a=m(a,c,f,i,n[h+3],10,-1894986606),i=m(i,a,c,f,n[h+10],15,-1051523),f=m(f,i,a,c,n[h+1],21,-2054922799),c=m(c,f,i,a,n[h+8],6,1873313359),a=m(a,c,f,i,n[h+15],10,-30611744),i=m(i,a,c,f,n[h+6],15,-1560198380),f=m(f,i,a,c,n[h+13],21,1309151649),c=m(c,f,i,a,n[h+4],6,-145523070),a=m(a,c,f,i,n[h+11],10,-1120210379),i=m(i,a,c,f,n[h+2],15,718787259),f=m(f,i,a,c,n[h+9],21,-343485551),c=d(c,r),f=d(f,e),i=d(i,o),a=d(a,u);return[c,f,i,a]}function a(n){for(var t="",r=32*n.length,e=0;e<r;e+=8)t+=String.fromCharCode(n[e>>5]>>>e%32&255);return t}function h(n){var t=[];for(t[(n.length>>2)-1]=void 0,e=0;e<t.length;e+=1)t[e]=0;for(var r=8*n.length,e=0;e<r;e+=8)t[e>>5]|=(255&n.charCodeAt(e/8))<<e%32;return t}function e(n){for(var t,r="0123456789abcdef",e="",o=0;o<n.length;o+=1)t=n.charCodeAt(o),e+=r.charAt(t>>>4&15)+r.charAt(15&t);return e}function r(n){return unescape(encodeURIComponent(n))}function o(n){return a(i(h(t=r(n)),8*t.length));var t}function u(n,t){return function(n,t){var r,e,o=h(n),u=[],c=[];for(u[15]=c[15]=void 0,16<o.length&&(o=i(o,8*n.length)),r=0;r<16;r+=1)u[r]=909522486^o[r],c[r]=1549556828^o[r];return e=i(u.concat(h(t)),512+8*t.length),a(i(c.concat(e),640))}(r(n),r(t))}function t(n,t,r){return t?r?u(t,n):e(u(t,n)):r?o(n):e(o(n))}"function"==typeof define&&define.amd?define(function(){return t}):"object"==typeof module&&module.exports?module.exports=t:n.md5=t}(this);</script><script>window.AbTest = (function() { return { 'ab_test': (uniqueId, test_name, buckets) => { let override = new URLSearchParams(window.location.search).get(`ab_test[${test_name}]`); if ( override ) { return override; } const bucketNames = buckets.map((bucket) => { return typeof bucket === 'string' ? bucket : Object.keys(bucket)[0]; }); const weights = buckets.map((bucket) => { return typeof bucket === 'string' ? 1 : Object.values(bucket)[0]; }); const total = weights.reduce((sum, weight) => sum + weight); const hash = md5(`${uniqueId}${test_name}`); const hashNum = parseInt(hash.slice(-12), 16); let bucketPoint = total * (hashNum % 100000) / 100000; const bucket = bucketNames.find((_, i) => { if (weights[i] > bucketPoint) { return true; } bucketPoint -= weights[i]; return false; }); return bucket; } }; })();</script><div data-auto_select="false" data-client_id="331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b" data-landing_url="https://www.academia.edu/Documents/in/Sorting" data-login_uri="https://www.academia.edu/registrations/google_one_tap" data-moment_callback="onGoogleOneTapEvent" id="g_id_onload"></div><script>function onGoogleOneTapEvent(event) { var momentType = event.getMomentType(); var momentReason = null; if (event.isNotDisplayed()) { momentReason = event.getNotDisplayedReason(); } else if (event.isSkippedMoment()) { momentReason = event.getSkippedReason(); } else if (event.isDismissedMoment()) { momentReason = event.getDismissedReason(); } Aedu.arbitraryEvents.write('GoogleOneTapEvent', { moment_type: momentType, moment_reason: momentReason, }); }</script><script>(function() { var auvid = unescape( document.cookie .split(/; ?/) .find((s) => s.startsWith('auvid')) .substring(6)); var bucket = AbTest.ab_test(auvid, 'lo_ri_one_tap_google_sign_on', ['control', 'one_tap_google_sign_on']); if (bucket === 'control') return; var oneTapTag = document.createElement('script') oneTapTag.async = true oneTapTag.defer = true oneTapTag.src = 'https://accounts.google.com/gsi/client' document.body.appendChild(oneTapTag) })();</script></div></div></div> </div> <div class="bootstrap login"><div class="modal fade login-modal" id="login-modal"><div class="login-modal-dialog modal-dialog"><div class="modal-content"><div class="modal-header"><button class="close close" data-dismiss="modal" type="button"><span aria-hidden="true">×</span><span class="sr-only">Close</span></button><h4 class="modal-title text-center"><strong>Log In</strong></h4></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><button class="btn btn-fb btn-lg btn-block btn-v-center-content" id="login-facebook-oauth-button"><svg style="float: left; width: 19px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="facebook-square" class="svg-inline--fa fa-facebook-square fa-w-14" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><path fill="currentColor" d="M400 32H48A48 48 0 0 0 0 80v352a48 48 0 0 0 48 48h137.25V327.69h-63V256h63v-54.64c0-62.15 37-96.48 93.67-96.48 27.14 0 55.52 4.84 55.52 4.84v61h-31.27c-30.81 0-40.42 19.12-40.42 38.73V256h68.78l-11 71.69h-57.78V480H400a48 48 0 0 0 48-48V80a48 48 0 0 0-48-48z"></path></svg><small><strong>Log in</strong> with <strong>Facebook</strong></small></button><br /><button class="btn btn-google btn-lg btn-block btn-v-center-content" id="login-google-oauth-button"><svg style="float: left; width: 22px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="google-plus" class="svg-inline--fa fa-google-plus fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M256,8C119.1,8,8,119.1,8,256S119.1,504,256,504,504,392.9,504,256,392.9,8,256,8ZM185.3,380a124,124,0,0,1,0-248c31.3,0,60.1,11,83,32.3l-33.6,32.6c-13.2-12.9-31.3-19.1-49.4-19.1-42.9,0-77.2,35.5-77.2,78.1S142.3,334,185.3,334c32.6,0,64.9-19.1,70.1-53.3H185.3V238.1H302.2a109.2,109.2,0,0,1,1.9,20.7c0,70.8-47.5,121.2-118.8,121.2ZM415.5,273.8v35.5H380V273.8H344.5V238.3H380V202.8h35.5v35.5h35.2v35.5Z"></path></svg><small><strong>Log in</strong> with <strong>Google</strong></small></button><br /><style type="text/css">.sign-in-with-apple-button { width: 100%; height: 52px; border-radius: 3px; border: 1px solid black; cursor: pointer; }</style><script src="https://appleid.cdn-apple.com/appleauth/static/jsapi/appleid/1/en_US/appleid.auth.js" type="text/javascript"></script><div class="sign-in-with-apple-button" data-border="false" data-color="white" id="appleid-signin"><span   ="Sign Up with Apple" class="u-fs11"></span></div><script>AppleID.auth.init({ clientId: 'edu.academia.applesignon', scope: 'name email', redirectURI: 'https://www.academia.edu/sessions', state: "09ae9b5547a716e7d43457d8c49da77540e64b8edbefb1dcb98c495899540c4b", });</script><script>// Hacky way of checking if on fast loswp if (window.loswp == null) { (function() { const Google = window?.Aedu?.Auth?.OauthButton?.Login?.Google; const Facebook = window?.Aedu?.Auth?.OauthButton?.Login?.Facebook; if (Google) { new Google({ el: '#login-google-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } if (Facebook) { new Facebook({ el: '#login-facebook-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } })(); }</script></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><div class="hr-heading login-hr-heading"><span class="hr-heading-text">or</span></div></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><form class="js-login-form" action="https://www.academia.edu/sessions" accept-charset="UTF-8" method="post"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><input type="hidden" name="authenticity_token" value="ha6A+cw/7pGaspKhSpgmOP/CQa/4fyFIjrn0/T5WMwN0DF/HwzZMUFSFs3y4r4E3zqyFI0sU8RS9yAtIhQkvYw==" autocomplete="off" /><div class="form-group"><label class="control-label" for="login-modal-email-input" style="font-size: 14px;">Email</label><input class="form-control" id="login-modal-email-input" name="login" type="email" /></div><div class="form-group"><label class="control-label" for="login-modal-password-input" style="font-size: 14px;">Password</label><input class="form-control" id="login-modal-password-input" name="password" type="password" /></div><input type="hidden" name="post_login_redirect_url" id="post_login_redirect_url" value="https://www.academia.edu/Documents/in/Sorting" autocomplete="off" /><div class="checkbox"><label><input type="checkbox" name="remember_me" id="remember_me" value="1" checked="checked" /><small style="font-size: 12px; margin-top: 2px; display: inline-block;">Remember me on this computer</small></label></div><br><input type="submit" name="commit" value="Log In" class="btn btn-primary btn-block btn-lg js-login-submit" data-disable-with="Log In" /></br></form><script>typeof window?.Aedu?.recaptchaManagedForm === 'function' && window.Aedu.recaptchaManagedForm( document.querySelector('.js-login-form'), document.querySelector('.js-login-submit') );</script><small style="font-size: 12px;"><br />or <a data-target="#login-modal-reset-password-container" data-toggle="collapse" href="javascript:void(0)">reset password</a></small><div class="collapse" id="login-modal-reset-password-container"><br /><div class="well margin-0x"><form class="js-password-reset-form" action="https://www.academia.edu/reset_password" accept-charset="UTF-8" method="post"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><input type="hidden" name="authenticity_token" value="f6/tX6xkoK4I4YChOaq0fPgcxLmzbuxljHyOxpSIKh2ODTJho20Cb8bWoXzLnRNzyXIANQAFPDm/DXFzL9c2fQ==" autocomplete="off" /><p>Enter the email address you signed up with and we'll email you a reset link.</p><div class="form-group"><input class="form-control" name="email" type="email" /></div><script src="https://recaptcha.net/recaptcha/api.js" async defer></script> <script> var invisibleRecaptchaSubmit = function () { var closestForm = function (ele) { var curEle = ele.parentNode; while (curEle.nodeName !== 'FORM' && curEle.nodeName !== 'BODY'){ curEle = curEle.parentNode; } return curEle.nodeName === 'FORM' ? curEle : null }; var eles = document.getElementsByClassName('g-recaptcha'); if (eles.length > 0) { var form = closestForm(eles[0]); if (form) { form.submit(); } } }; </script> <input type="submit" data-sitekey="6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj" data-callback="invisibleRecaptchaSubmit" class="g-recaptcha btn btn-primary btn-block" value="Email me a link" value=""/> </form></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/collapse-45805421cf446ca5adf7aaa1935b08a3a8d1d9a6cc5d91a62a2a3a00b20b3e6a.js"], function() { // from javascript_helper.rb $("#login-modal-reset-password-container").on("shown.bs.collapse", function() { $(this).find("input[type=email]").focus(); }); }); </script> </div></div></div><div class="modal-footer"><div class="text-center"><small style="font-size: 12px;">Need an account? <a rel="nofollow" href="https://www.academia.edu/signup">Click here to sign up</a></small></div></div></div></div></div></div><script>// If we are on subdomain or non-bootstrapped page, redirect to login page instead of showing modal (function(){ if (typeof $ === 'undefined') return; var host = window.location.hostname; if ((host === $domain || host === "www."+$domain) && (typeof $().modal === 'function')) { $("#nav_log_in").click(function(e) { // Don't follow the link and open the modal e.preventDefault(); $("#login-modal").on('shown.bs.modal', function() { $(this).find("#login-modal-email-input").focus() }).modal('show'); }); } })()</script> <div class="bootstrap" id="footer"><div class="footer-content clearfix text-center padding-top-7x" style="width:100%;"><ul class="footer-links-secondary footer-links-wide list-inline margin-bottom-1x"><li><a href="https://www.academia.edu/about">About</a></li><li><a href="https://www.academia.edu/press">Press</a></li><li><a rel="nofollow" href="https://medium.com/academia">Blog</a></li><li><a href="https://www.academia.edu/documents">Papers</a></li><li><a href="https://www.academia.edu/topics">Topics</a></li><li><a href="https://www.academia.edu/journals">Academia.edu Journals</a></li><li><a rel="nofollow" href="https://www.academia.edu/hiring"><svg style="width: 13px; height: 13px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="briefcase" class="svg-inline--fa fa-briefcase fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M320 336c0 8.84-7.16 16-16 16h-96c-8.84 0-16-7.16-16-16v-48H0v144c0 25.6 22.4 48 48 48h416c25.6 0 48-22.4 48-48V288H320v48zm144-208h-80V80c0-25.6-22.4-48-48-48H176c-25.6 0-48 22.4-48 48v48H48c-25.6 0-48 22.4-48 48v80h512v-80c0-25.6-22.4-48-48-48zm-144 0H192V96h128v32z"></path></svg> <strong>We're Hiring!</strong></a></li><li><a rel="nofollow" href="https://support.academia.edu/"><svg style="width: 12px; height: 12px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="question-circle" class="svg-inline--fa fa-question-circle fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M504 256c0 136.997-111.043 248-248 248S8 392.997 8 256C8 119.083 119.043 8 256 8s248 111.083 248 248zM262.655 90c-54.497 0-89.255 22.957-116.549 63.758-3.536 5.286-2.353 12.415 2.715 16.258l34.699 26.31c5.205 3.947 12.621 3.008 16.665-2.122 17.864-22.658 30.113-35.797 57.303-35.797 20.429 0 45.698 13.148 45.698 32.958 0 14.976-12.363 22.667-32.534 33.976C247.128 238.528 216 254.941 216 296v4c0 6.627 5.373 12 12 12h56c6.627 0 12-5.373 12-12v-1.333c0-28.462 83.186-29.647 83.186-106.667 0-58.002-60.165-102-116.531-102zM256 338c-25.365 0-46 20.635-46 46 0 25.364 20.635 46 46 46s46-20.636 46-46c0-25.365-20.635-46-46-46z"></path></svg> <strong>Help Center</strong></a></li></ul><ul class="footer-links-tertiary list-inline margin-bottom-1x"><li class="small">Find new research papers in:</li><li class="small"><a href="https://www.academia.edu/Documents/in/Physics">Physics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Chemistry">Chemistry</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Biology">Biology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Health_Sciences">Health Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Ecology">Ecology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Earth_Sciences">Earth Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Mathematics">Mathematics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a></li></ul></div></div><div class="DesignSystem" id="credit" style="width:100%;"><ul class="u-pl0x footer-links-legal list-inline"><li><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li>Academia ©2024</li></ul></div><script> //<![CDATA[ window.detect_gmtoffset = true; window.Academia && window.Academia.set_gmtoffset && Academia.set_gmtoffset('/gmtoffset'); //]]> </script> <div id='overlay_background'></div> <div id='bootstrap-modal-container' class='bootstrap'></div> <div id='ds-modal-container' class='bootstrap DesignSystem'></div> <div id='full-screen-modal'></div> </div> </body> </html>