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>Dr.Kajla Basu - 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': "profiles/works", 'action': "summary", 'controller_action': 'profiles/works#summary', '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="xErWLmMo_VTqy4WGhs85JkI2GqhljvP_rNeJahEdSnaIdIJSSMKUiJSPMchCsgQjsaGu0VG69SjFWfas1ObdqQ" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/wow-3d36c19b4875b226bfed0fcba1dcea3f2fe61148383d97c0465c016b8c969290.css" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/social/home-79e78ce59bef0a338eb6540ec3d93b4a7952115b56c57f1760943128f4544d42.css" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/heading-95367dc03b794f6737f30123738a886cf53b7a65cdef98a922a98591d60063e3.css" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/button-bfbac2a470372e2f3a6661a65fa7ff0a0fbf7aa32534d9a831d683d2a6f9e01b.css" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/body-170d1319f0e354621e81ca17054bb147da2856ec0702fe440a99af314a6338c5.css" /><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-2b6f90dbd75f5941bc38f4ad716615f3ac449e7398313bb3bc225fba451cd9fa.css" /> <meta name="author" content="dr.kajla basu" /> <meta name="description" content="Dr.Kajla Basu: 1 Follower, 1 Following, 33 Research papers. Research interests: DNA computing, Molecular Sequence Data, and Bio-Inspired Systems." /> <meta name="google-site-verification" content="bKJMBZA7E43xhDOopFZkssMMkBRjvYERV-NaN4R6mrs" /> <script> var $controller_name = 'works'; var $action_name = "summary"; var $rails_env = 'production'; var $app_rev = '465843958ef5887474276b9822f8eec15d0a2633'; 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":14029,"monthly_visitors":"102 million","monthly_visitor_count":102411812,"monthly_visitor_count_in_millions":102,"user_count":283220721,"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(1740000826000); window.Aedu.timeDifference = new Date().getTime() - 1740000826000; 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 rel="preload" href="//maxcdn.bootstrapcdn.com/font-awesome/4.3.0/css/font-awesome.min.css" as="style" onload="this.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-40698df34f913bd208bb70f09d2feb7c6286046250be17a4db35bba2c08b0e2f.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-a22f75d8519394c21253dae46c8c5d60ad36ea68c7d494347ec64229d8c1cf85.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/core_webpack.wjs-bundle-5708a105dd66b4c7d0ef30b7c094b1048423f0042bd2a7b123f2d99ee3cf46d9.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://independent.academia.edu/DrKajlaBasu" /> </head>   <body class='c-profiles/works a-summary logged_out'>  <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"><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"><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="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/hc/en-us"><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> <script src="//a.academia-assets.com/assets/webpack_bundles/profile.wjs-bundle-d2e1f3b718105954b4f74780bccfac5f00781dba3ece3e10d5add9db69fa013a.js" defer="defer"></script><script>$viewedUser = Aedu.User.set_viewed( {"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu","photo":"https://0.academia-photos.com/227760845/84634117/73270097/s65_dr.kajla.basu.jpeg","has_photo":true,"is_analytics_public":false,"interests":[{"id":25781,"name":"DNA computing","url":"https://www.academia.edu/Documents/in/DNA_computing"},{"id":2467566,"name":"Molecular Sequence Data","url":"https://www.academia.edu/Documents/in/Molecular_Sequence_Data"},{"id":20463,"name":"Bio-Inspired Systems","url":"https://www.academia.edu/Documents/in/Bio-Inspired_Systems"},{"id":809882,"name":"Base Sequence","url":"https://www.academia.edu/Documents/in/Base_Sequence"},{"id":35486,"name":"Agile Methods (Software Engineering)","url":"https://www.academia.edu/Documents/in/Agile_Methods_Software_Engineering_"}]} ); if ($a.is_logged_in() && $viewedUser.is_current_user()) { $('body').addClass('profile-viewed-by-owner'); } $socialProfiles = []</script><div id="js-react-on-rails-context" style="display:none" data-rails-context="{"inMailer":false,"i18nLocale":"en","i18nDefaultLocale":"en","href":"https://independent.academia.edu/DrKajlaBasu","location":"/DrKajlaBasu","scheme":"https","host":"independent.academia.edu","port":null,"pathname":"/DrKajlaBasu","search":null,"httpAcceptLanguage":null,"serverSide":false}"></div> <div class="js-react-on-rails-component" style="display:none" data-component-name="ProfileCheckPaperUpdate" data-props="{}" data-trace="false" data-dom-id="ProfileCheckPaperUpdate-react-component-f2fc88a2-c8d8-44fd-908c-1ed95ad89e5e"></div> <div id="ProfileCheckPaperUpdate-react-component-f2fc88a2-c8d8-44fd-908c-1ed95ad89e5e"></div> <div class="DesignSystem"><div class="onsite-ping" id="onsite-ping"></div></div><div class="profile-user-info DesignSystem"><div class="social-profile-container"><div class="left-panel-container"><div class="user-info-component-wrapper"><div class="user-summary-cta-container"><div class="user-summary-container"><div class="social-profile-avatar-container"><img class="profile-avatar u-positionAbsolute" alt="Dr.Kajla Basu" border="0" onerror="if (this.src != '//a.academia-assets.com/images/s200_no_pic.png') this.src = '//a.academia-assets.com/images/s200_no_pic.png';" width="200" height="200" src="https://0.academia-photos.com/227760845/84634117/73270097/s200_dr.kajla.basu.jpeg" /></div><div class="title-container"><h1 class="ds2-5-heading-sans-serif-sm">Dr.Kajla Basu</h1><div class="affiliations-container fake-truncate js-profile-affiliations"></div></div></div><div class="sidebar-cta-container"><button class="ds2-5-button hidden profile-cta-button grow js-profile-follow-button" data-broccoli-component="user-info.follow-button" data-click-track="profile-user-info-follow-button" data-follow-user-fname="Dr.Kajla" data-follow-user-id="227760845" data-follow-user-source="profile_button" data-has-google="false"><span class="material-symbols-outlined" style="font-size: 20px" translate="no">add</span>Follow</button><button class="ds2-5-button hidden profile-cta-button grow js-profile-unfollow-button" data-broccoli-component="user-info.unfollow-button" data-click-track="profile-user-info-unfollow-button" data-unfollow-user-id="227760845"><span class="material-symbols-outlined" style="font-size: 20px" translate="no">done</span>Following</button></div></div><div class="user-stats-container"><a><div class="stat-container js-profile-followers"><p class="label">Follower</p><p class="data">1</p></div></a><a><div class="stat-container js-profile-followees" data-broccoli-component="user-info.followees-count" data-click-track="profile-expand-user-info-following"><p class="label">Following</p><p class="data">1</p></div></a><div class="js-mentions-count-container" style="display: none;"><a href="/DrKajlaBasu/mentions"><div class="stat-container"><p class="label">Mentions</p><p class="data"></p></div></a></div><span><div class="stat-container"><p class="label"><span class="js-profile-total-view-text">Public Views</span></p><p class="data"><span class="js-profile-view-count"></span></p></div></span></div><div class="suggested-academics-container"><div class="suggested-academics--header"><p class="ds2-5-body-md-bold">Related Authors</p></div><ul class="suggested-user-card-list"><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://ngbtc.academia.edu/SurapatiPramanik"><img class="profile-avatar u-positionAbsolute" alt="Surapati Pramanik" border="0" onerror="if (this.src != '//a.academia-assets.com/images/s200_no_pic.png') this.src = '//a.academia-assets.com/images/s200_no_pic.png';" width="200" height="200" src="https://0.academia-photos.com/2018023/7079584/7977657/s200_surapati.pramanik.jpg" /></a></div><div class="suggested-user-card__user-info"><a class="suggested-user-card__user-info__header ds2-5-body-sm-bold ds2-5-body-link" href="https://ngbtc.academia.edu/SurapatiPramanik">Surapati Pramanik</a></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://unm.academia.edu/FlorentinSmarandache"><img class="profile-avatar u-positionAbsolute" alt="Florentin Smarandache" border="0" onerror="if (this.src != '//a.academia-assets.com/images/s200_no_pic.png') this.src = '//a.academia-assets.com/images/s200_no_pic.png';" width="200" height="200" src="https://0.academia-photos.com/4976797/2550910/36066018/s200_florentin.smarandache.jpg" /></a></div><div class="suggested-user-card__user-info"><a class="suggested-user-card__user-info__header ds2-5-body-sm-bold ds2-5-body-link" href="https://unm.academia.edu/FlorentinSmarandache">Florentin Smarandache</a><p class="suggested-user-card__user-info__subheader ds2-5-body-xs">University of New Mexico</p></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://independent.academia.edu/FlorentinSmarandache"><img class="profile-avatar u-positionAbsolute" alt="Florentin Smarandache" border="0" onerror="if (this.src != '//a.academia-assets.com/images/s200_no_pic.png') this.src = '//a.academia-assets.com/images/s200_no_pic.png';" width="200" height="200" src="https://0.academia-photos.com/7314052/2706516/3151123/s200_florentin.smarandache.jpg" /></a></div><div class="suggested-user-card__user-info"><a class="suggested-user-card__user-info__header ds2-5-body-sm-bold ds2-5-body-link" href="https://independent.academia.edu/FlorentinSmarandache">Florentin Smarandache</a></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://ngbtc.academia.edu/SPramanik"><img class="profile-avatar u-positionAbsolute" alt="Surapati Pramanik, Ph. D." border="0" onerror="if (this.src != '//a.academia-assets.com/images/s200_no_pic.png') this.src = '//a.academia-assets.com/images/s200_no_pic.png';" width="200" height="200" src="https://0.academia-photos.com/19895610/7901710/8852826/s200_surapati.pramanik.jpg" /></a></div><div class="suggested-user-card__user-info"><a class="suggested-user-card__user-info__header ds2-5-body-sm-bold ds2-5-body-link" href="https://ngbtc.academia.edu/SPramanik">Surapati Pramanik, Ph. D.</a></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://buodisha.academia.edu/SantanuKumarPatro"><img class="profile-avatar u-positionAbsolute" alt="SANTANU KUMAR PATRO" border="0" onerror="if (this.src != '//a.academia-assets.com/images/s200_no_pic.png') this.src = '//a.academia-assets.com/images/s200_no_pic.png';" width="200" height="200" src="https://0.academia-photos.com/58318834/15272076/16729570/s200_santanu_kumar.patro.jpg" /></a></div><div class="suggested-user-card__user-info"><a class="suggested-user-card__user-info__header ds2-5-body-sm-bold ds2-5-body-link" href="https://buodisha.academia.edu/SantanuKumarPatro">SANTANU KUMAR PATRO</a><p class="suggested-user-card__user-info__subheader ds2-5-body-xs">Berhampur University</p></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://independent.academia.edu/MarzoukEman"><img class="profile-avatar u-positionAbsolute" border="0" alt="" src="//a.academia-assets.com/images/s200_no_pic.png" /></a></div><div class="suggested-user-card__user-info"><a class="suggested-user-card__user-info__header ds2-5-body-sm-bold ds2-5-body-link" href="https://independent.academia.edu/MarzoukEman">Eman Marzouk</a></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://independent.academia.edu/MirelaTeodorescu"><img class="profile-avatar u-positionAbsolute" alt="Mirela Teodorescu" border="0" onerror="if (this.src != '//a.academia-assets.com/images/s200_no_pic.png') this.src = '//a.academia-assets.com/images/s200_no_pic.png';" width="200" height="200" src="https://0.academia-photos.com/6392819/3504313/4115627/s200_mirela.teodorescu.jpg" /></a></div><div class="suggested-user-card__user-info"><a class="suggested-user-card__user-info__header ds2-5-body-sm-bold ds2-5-body-link" href="https://independent.academia.edu/MirelaTeodorescu">Mirela Teodorescu</a></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://independent.academia.edu/MohamedTalea"><img class="profile-avatar u-positionAbsolute" border="0" alt="" src="//a.academia-assets.com/images/s200_no_pic.png" /></a></div><div class="suggested-user-card__user-info"><a class="suggested-user-card__user-info__header ds2-5-body-sm-bold ds2-5-body-link" href="https://independent.academia.edu/MohamedTalea">Mohamed Talea</a></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://uotelafer.academia.edu/HudaKhalid"><img class="profile-avatar u-positionAbsolute" alt="Huda E . Khalid" border="0" onerror="if (this.src != '//a.academia-assets.com/images/s200_no_pic.png') this.src = '//a.academia-assets.com/images/s200_no_pic.png';" width="200" height="200" src="https://0.academia-photos.com/36196985/10431764/23496575/s200_huda.khalid.jpg" /></a></div><div class="suggested-user-card__user-info"><a class="suggested-user-card__user-info__header ds2-5-body-sm-bold ds2-5-body-link" href="https://uotelafer.academia.edu/HudaKhalid">Huda E . Khalid</a></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://independent.academia.edu/sharifulalam79"><img class="profile-avatar u-positionAbsolute" alt="shariful alam" border="0" onerror="if (this.src != '//a.academia-assets.com/images/s200_no_pic.png') this.src = '//a.academia-assets.com/images/s200_no_pic.png';" width="200" height="200" src="https://0.academia-photos.com/241765416/96698071/85855258/s200_shariful.alam.jpeg" /></a></div><div class="suggested-user-card__user-info"><a class="suggested-user-card__user-info__header ds2-5-body-sm-bold ds2-5-body-link" href="https://independent.academia.edu/sharifulalam79">shariful alam</a></div></div></ul></div><div class="ri-section"><div class="ri-section-header"><span>Interests</span></div><div class="ri-tags-container"><a data-click-track="profile-user-info-expand-research-interests" data-has-card-for-ri-list="227760845" href="https://www.academia.edu/Documents/in/DNA_computing"><div id="js-react-on-rails-context" style="display:none" data-rails-context="{"inMailer":false,"i18nLocale":"en","i18nDefaultLocale":"en","href":"https://independent.academia.edu/DrKajlaBasu","location":"/DrKajlaBasu","scheme":"https","host":"independent.academia.edu","port":null,"pathname":"/DrKajlaBasu","search":null,"httpAcceptLanguage":null,"serverSide":false}"></div> <div class="js-react-on-rails-component" style="display:none" data-component-name="Pill" data-props="{"color":"gray","children":["DNA computing"]}" data-trace="false" data-dom-id="Pill-react-component-74fda334-0799-4541-b9b2-951387240465"></div> <div id="Pill-react-component-74fda334-0799-4541-b9b2-951387240465"></div> </a><a data-click-track="profile-user-info-expand-research-interests" data-has-card-for-ri-list="227760845" href="https://www.academia.edu/Documents/in/Molecular_Sequence_Data"><div class="js-react-on-rails-component" style="display:none" data-component-name="Pill" data-props="{"color":"gray","children":["Molecular Sequence Data"]}" data-trace="false" data-dom-id="Pill-react-component-a01a5282-fa27-4628-9002-18bd97b674e8"></div> <div id="Pill-react-component-a01a5282-fa27-4628-9002-18bd97b674e8"></div> </a><a data-click-track="profile-user-info-expand-research-interests" data-has-card-for-ri-list="227760845" href="https://www.academia.edu/Documents/in/Bio-Inspired_Systems"><div class="js-react-on-rails-component" style="display:none" data-component-name="Pill" data-props="{"color":"gray","children":["Bio-Inspired Systems"]}" data-trace="false" data-dom-id="Pill-react-component-bd2c2bf4-9002-448a-b1f5-bf6f65ef2a82"></div> <div id="Pill-react-component-bd2c2bf4-9002-448a-b1f5-bf6f65ef2a82"></div> </a><a data-click-track="profile-user-info-expand-research-interests" data-has-card-for-ri-list="227760845" href="https://www.academia.edu/Documents/in/Base_Sequence"><div class="js-react-on-rails-component" style="display:none" data-component-name="Pill" data-props="{"color":"gray","children":["Base Sequence"]}" data-trace="false" data-dom-id="Pill-react-component-53eb6552-dab2-458e-89b6-396d136a6a40"></div> <div id="Pill-react-component-53eb6552-dab2-458e-89b6-396d136a6a40"></div> </a><a data-click-track="profile-user-info-expand-research-interests" data-has-card-for-ri-list="227760845" href="https://www.academia.edu/Documents/in/Agile_Methods_Software_Engineering_"><div class="js-react-on-rails-component" style="display:none" data-component-name="Pill" data-props="{"color":"gray","children":["Agile Methods (Software Engineering)"]}" data-trace="false" data-dom-id="Pill-react-component-87854765-e5c2-4668-afd6-d15491341e1d"></div> <div id="Pill-react-component-87854765-e5c2-4668-afd6-d15491341e1d"></div> </a></div></div></div></div><div class="right-panel-container"><div class="user-content-wrapper"><div class="uploads-container" id="social-redesign-work-container"><div class="upload-header"><h2 class="ds2-5-heading-sans-serif-xs">Uploads</h2></div><div class="documents-container backbone-social-profile-documents" style="width: 100%;"><div class="u-taCenter"></div><div class="profile--tab_content_container js-tab-pane tab-pane active" id="all"><div class="profile--tab_heading_container js-section-heading" data-section="Papers" id="Papers"><h3 class="profile--tab_heading_container">Papers by Dr.Kajla Basu</h3></div><div class="js-work-strip profile--work_container" data-work-id="97900210"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/97900210/Multi_Criteria_Decision_Making_Method_In_Neutrosophic_Environment_Using_A_New_Aggregation_Operator_Score_And_Certainty_Function"><img alt="Research paper thumbnail of Multi Criteria Decision Making Method In Neutrosophic Environment Using A New Aggregation Operator, Score And Certainty Function" class="work-thumbnail" src="https://attachments.academia-assets.com/99397927/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/97900210/Multi_Criteria_Decision_Making_Method_In_Neutrosophic_Environment_Using_A_New_Aggregation_Operator_Score_And_Certainty_Function">Multi Criteria Decision Making Method In Neutrosophic Environment Using A New Aggregation Operator, Score And Certainty Function</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Neutrosophic sets, being generalization of classic sets, fuzzy sets and intuitionistic fuzzy sets...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Neutrosophic sets, being generalization of classic sets, fuzzy sets and intuitionistic fuzzy sets, can simultaneously represent uncertain, imprecise, incomplete, and inconsistent information existing in the real world. Neutrosophic theory has been developed in twenty first century and not much of arithmetic has been developed for this set. To solve any problem using neutrosophic data, it is desirable to have suitable operators, score function etc. Some operators like single valued neutrosophic weighted averaging (SVNWA) operator, single valued neutrosophic weighted geometric (SVNWG) operator are already defined in neutrosophic set (NS). In this paper an improved weighted average geometric (IWAG) operator which produces more meaningful results has been introduced to aggregate some real numbers and the same has been extended in neutrosophic environment.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="4e91fa2cfaf7f1c18cd93b609f1aaa95" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":99397927,"asset_id":97900210,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/99397927/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="97900210"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="97900210"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 97900210; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=97900210]").text(description); $(".js-view-count[data-work-id=97900210]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 97900210; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='97900210']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "4e91fa2cfaf7f1c18cd93b609f1aaa95" } } $('.js-work-strip[data-work-id=97900210]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":97900210,"title":"Multi Criteria Decision Making Method In Neutrosophic Environment Using A New Aggregation Operator, Score And Certainty Function","internal_url":"https://www.academia.edu/97900210/Multi_Criteria_Decision_Making_Method_In_Neutrosophic_Environment_Using_A_New_Aggregation_Operator_Score_And_Certainty_Function","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":99397927,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/99397927/thumbnails/1.jpg","file_name":"MultiCriteriaDecisionMakingMethod.pdf","download_url":"https://www.academia.edu/attachments/99397927/download_file","bulk_download_file_name":"Multi_Criteria_Decision_Making_Method_In.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/99397927/MultiCriteriaDecisionMakingMethod-libre.pdf?1677920705=\u0026response-content-disposition=attachment%3B+filename%3DMulti_Criteria_Decision_Making_Method_In.pdf\u0026Expires=1740004425\u0026Signature=WafYbIl~qqy6Dv7Vm1lY7au2MB-TosBPrMSwneJJDpJynFWTM48PDbnb5MPg55RGcPUhdgBg45OLRClnXfAekcSNcK7JLkRJEUICBHrxzDxkH376Z95JjJz4D8ECZ1u9kKVagzKVDc3LGHSA47h3OxgWdpKC9XSQSZ~YfN4Fq8F07v9Td47-xLjIJQ8hBcbbqI~sKbSUTGzpmWwKqdqnKfx9UlaxDjY-M8Gsd1D-30x7bhzt8RSUHyoyRNHd~JUROlSYGgN2gXf5uTSWrkIZmg3i4C8OBZGYDLk1wZ9hiO9r3QTmkVo4SVrSxI2egGWkTgFaMPySL6l-Y2ITxTHTJQ__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="97900209"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/97900209/Hypercomplex_Neutrosophic_Similarity_Measure_and_Its_Application_in_Multi_Criteria_Dicision_Making_Problem"><img alt="Research paper thumbnail of Hypercomplex Neutrosophic Similarity Measure & Its Application in Multi-Criteria Dicision Making Problem" class="work-thumbnail" src="https://attachments.academia-assets.com/99397913/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/97900209/Hypercomplex_Neutrosophic_Similarity_Measure_and_Its_Application_in_Multi_Criteria_Dicision_Making_Problem">Hypercomplex Neutrosophic Similarity Measure & Its Application in Multi-Criteria Dicision Making Problem</a></div><div class="wp-workCard_item"><span>viXra</span><span>, 2015</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Neutrosophic set is very useful to express uncertainty,impreciseness, incompleteness and inconsis...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Neutrosophic set is very useful to express uncertainty,impreciseness, incompleteness and inconsistency in a more general way.It is prevalent in real life application problems to express both indeterminate and inconsistent information.This paper focuses on introducing a new similarity measure in the neutrosophic environment.Similarity measure approach can be used in ranking the alternatives and determining the best among them.It is useful to find the optimum alternative for multicriteria decision making (MCDM) problems from similar alternatives in neutrosophic form.We define a function based on hypercomplex number system in this paper to determine the degree of similarity between single valued neutrosophic sets and thus a new approach to rank the alternatives in MCDM problems has been introduced.The approach of using hypercomplex number system in formulating the similarity measure in neutrosophic set is new and is not available in literature so far.Finally,a numerical example demonst...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="d542c46251caaa09ae6f4330577d1660" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":99397913,"asset_id":97900209,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/99397913/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="97900209"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="97900209"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 97900209; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=97900209]").text(description); $(".js-view-count[data-work-id=97900209]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 97900209; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='97900209']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "d542c46251caaa09ae6f4330577d1660" } } $('.js-work-strip[data-work-id=97900209]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":97900209,"title":"Hypercomplex Neutrosophic Similarity Measure \u0026 Its Application in Multi-Criteria Dicision Making Problem","internal_url":"https://www.academia.edu/97900209/Hypercomplex_Neutrosophic_Similarity_Measure_and_Its_Application_in_Multi_Criteria_Dicision_Making_Problem","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":99397913,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/99397913/thumbnails/1.jpg","file_name":"Hypercomplex_20Neutrosophic_20Similarity_20Measure.pdf","download_url":"https://www.academia.edu/attachments/99397913/download_file","bulk_download_file_name":"Hypercomplex_Neutrosophic_Similarity_Mea.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/99397913/Hypercomplex_20Neutrosophic_20Similarity_20Measure-libre.pdf?1677920713=\u0026response-content-disposition=attachment%3B+filename%3DHypercomplex_Neutrosophic_Similarity_Mea.pdf\u0026Expires=1740004425\u0026Signature=F48g-suJoR8C8edS49ughC3~inYPf94EL-6ok7frmd53HPUMEZKgpTc4u43IiPNZJmWSHiuOyGhchy~4WEKzmdnBQQ7YsBeiAFJKM2ygjnQAEbxuijt0gx4ujqvIfRsC2fc8SbedV-XSi6J5w4X1-6b1P6r1sLdoXXa4eK46JoCtviigh2tyAtLRwG9nKNujPnjfMLgNwOBBEEySe~SQ8GtJaox~Nx9SqnEg4o54WZHdZi7mT5N0V49hvFQ7lkUy52N1zJfhY0Kh5XFHv6txBZ3XVOkT4JXIzOn0Ry0X6~S9Rdhg2lwnGhzNeC1-hXk-KM5V9B1kDw8KoJ2aBFthDA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="97900207"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/97900207/Solution_of_Generalized_Fuzzy_Assignment_Problem_with_Restriction_on_Costs_under_Fuzzy_Environment"><img alt="Research paper thumbnail of Solution of Generalized Fuzzy Assignment Problem with Restriction on Costs under Fuzzy Environment" class="work-thumbnail" src="https://attachments.academia-assets.com/99397910/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/97900207/Solution_of_Generalized_Fuzzy_Assignment_Problem_with_Restriction_on_Costs_under_Fuzzy_Environment">Solution of Generalized Fuzzy Assignment Problem with Restriction on Costs under Fuzzy Environment</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">To solve the problems of Engineering and Management Science Generalized Assignment Problem (GAP) ...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">To solve the problems of Engineering and Management Science Generalized Assignment Problem (GAP) plays a very important role. The GAP is a classical example of a difficult combinatorial optimization problem that has received considerable attention over the years due to its widespread applications. In many instances it appears as a substructure in more complicated models, including routing problems, facility location models, knapsack problems, computer networking applications etc. Recently, Fuzzy Generalized Assignment Problem (FGAP) became very popular because in real life, data may not be known with certainty. So, to consider uncertainty in real life situations fuzzy data instead of crisp data is more advantageous. In this paper, cost for assigning the j-th job to the i-th person is taken as triangular fuzzy numbers. Further we have put a restriction on the total available cost which makes the problem more realistic and general. The problem is solved by modified Fuzzy Extremum Diff...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="76f6dd61735b4bb31c8a75add82ebf66" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":99397910,"asset_id":97900207,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/99397910/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="97900207"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="97900207"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 97900207; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=97900207]").text(description); $(".js-view-count[data-work-id=97900207]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 97900207; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='97900207']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "76f6dd61735b4bb31c8a75add82ebf66" } } $('.js-work-strip[data-work-id=97900207]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":97900207,"title":"Solution of Generalized Fuzzy Assignment Problem with Restriction on Costs under Fuzzy Environment","internal_url":"https://www.academia.edu/97900207/Solution_of_Generalized_Fuzzy_Assignment_Problem_with_Restriction_on_Costs_under_Fuzzy_Environment","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":99397910,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/99397910/thumbnails/1.jpg","file_name":"ijfmsv4n2_06.pdf","download_url":"https://www.academia.edu/attachments/99397910/download_file","bulk_download_file_name":"Solution_of_Generalized_Fuzzy_Assignment.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/99397910/ijfmsv4n2_06-libre.pdf?1677920718=\u0026response-content-disposition=attachment%3B+filename%3DSolution_of_Generalized_Fuzzy_Assignment.pdf\u0026Expires=1740004425\u0026Signature=D3qU-ykLBnU1w3GrkEmMvc8juhY3Py1WJlX9rcALMlnEm-h9~gbrRRTojKOciPwOUR3oOgJ95MnPH2gEXsIN8EOU8wvmf9fHEkR6MbKsV3j7wHycwoL3Q5wOaTr2knkzgEiO21TstL6~uYGOg-WJQk-DRE18wbF~Tbnvlp2j8ZiCUZIgS7Q4dG8Y2Oloi9r0Lb-ARnTJs0lr22k1T41vGdUDCdui6APLj74Pt6Q6IqLANkv48CcculWVofYyNyeVH1ykkHp6bBiQKj7teMBp0jnmB15pBR70~ZhbEIlWD1LtYgcp6BRz0DI5WfFa4FZd87ZS5eaGicFdSvCrz7Fkzg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"},{"id":99397909,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/99397909/thumbnails/1.jpg","file_name":"ijfmsv4n2_06.pdf","download_url":"https://www.academia.edu/attachments/99397909/download_file","bulk_download_file_name":"Solution_of_Generalized_Fuzzy_Assignment.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/99397909/ijfmsv4n2_06-libre.pdf?1677920718=\u0026response-content-disposition=attachment%3B+filename%3DSolution_of_Generalized_Fuzzy_Assignment.pdf\u0026Expires=1740004425\u0026Signature=P6wHMwvzmLGCKFQkO3uGbskr29Tir44DOYmzdZKeCHDSk9NPmO7E8LwRT7FrLu4PiwIgJTC42lcct3l8c8vRliQTGZmP4ovk42CLUN~cvKr7pPq7GNeb82ZgRZvVHRm6gT6EhFXCvtY72OMIZKdgpKc-XKk8gmMkH7pDG1pinGY2cPrb4FR4Iq8rwEKlmMn2Hk-bqeHXS1s0KzHD0dC1m6Lc3w0wE-zFw6f7KQgbdTO0u4ylz7dPsyiig5E0Kn5UuqW-dg17L5FwLZG0nNfWQTpXKcvFSNmrfLfMKwEIWE6x~RX7MmTqZ4tZNNbdfmIQJUVtA9xZcITgDKpDB-Tqdw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148470"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148470/Comparative_Study_of_Evolutionary_Algorithms_for_the_Optimum_Design_of_Thin_Broadband_Multilayer_Microwave_Absorber_for_Oblique_Incidence"><img alt="Research paper thumbnail of Comparative Study of Evolutionary Algorithms for the Optimum Design of Thin Broadband Multilayer Microwave Absorber for Oblique Incidence" class="work-thumbnail" src="https://attachments.academia-assets.com/95235259/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148470/Comparative_Study_of_Evolutionary_Algorithms_for_the_Optimum_Design_of_Thin_Broadband_Multilayer_Microwave_Absorber_for_Oblique_Incidence">Comparative Study of Evolutionary Algorithms for the Optimum Design of Thin Broadband Multilayer Microwave Absorber for Oblique Incidence</a></div><div class="wp-workCard_item"><span>International Journal of Microwave Engineering</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">With the increasing levels of Electromagnetic pollution almost exponentially in this modern age o...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">With the increasing levels of Electromagnetic pollution almost exponentially in this modern age of Electronics reported and highlighted by numerous studies carried out by scientists from all over the world, inspire engineers to concentrate their research for the optimum design of multilayer microwave absorber considering various parameters which are inherently conflicting in nature. In this paper we mainly focus on the comparative study of different Evolutionary algorithms for the optimum design of thin broadband (2-20GHz) multilayer microwave absorber for oblique incidence (30 0) considering arbitrary polarization of the electromagnetic waves. Different models are presented and synthesized using various Evolutionary algorithm namely Firefly algorithm (FA), Particle swarm optimization (PSO), Artificial bee colony optimization (ABC) and the best simulated results are tabulated and compared with each others.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="8a8e0f33122923f84c93f8656a692080" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235259,"asset_id":92148470,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235259/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148470"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148470"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148470; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148470]").text(description); $(".js-view-count[data-work-id=92148470]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148470; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148470']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "8a8e0f33122923f84c93f8656a692080" } } $('.js-work-strip[data-work-id=92148470]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148470,"title":"Comparative Study of Evolutionary Algorithms for the Optimum Design of Thin Broadband Multilayer Microwave Absorber for Oblique Incidence","internal_url":"https://www.academia.edu/92148470/Comparative_Study_of_Evolutionary_Algorithms_for_the_Optimum_Design_of_Thin_Broadband_Multilayer_Microwave_Absorber_for_Oblique_Incidence","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235259,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235259/thumbnails/1.jpg","file_name":"1116jmicro04.pdf","download_url":"https://www.academia.edu/attachments/95235259/download_file","bulk_download_file_name":"Comparative_Study_of_Evolutionary_Algori.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235259/1116jmicro04-libre.pdf?1670148661=\u0026response-content-disposition=attachment%3B+filename%3DComparative_Study_of_Evolutionary_Algori.pdf\u0026Expires=1740004425\u0026Signature=HIA5yPcY59d5dLYcUg9Bw-FdS8UUQQtjk8lQ12CnsLS6o-yPqWEzBajnU6oFOgfOvpHDFsxUSr2GId1gk7Qt3m6SErXW9IXbrnaMCahQHQHuj4Bne9M9FlT-iQeliTDX6mRsWbVl5CO9-YO-aY0GMTw~OckLwYbIJixABSys2va1vmsxv8A0J5hS8~ziDpFOQ~MtiVJAaq8naswQHRYoH66FDGs9WVAvBpbyzyjvsen7fPdr2dg8vLvUfv4a2v4IEGXA6qhlmtlNVIS8uhM~~Cs5lwIUFxZKOSaxs6QgLFg-jNo4J5Mdb-hDkzQjlnYCHQchGZgJPAwvw3Ju~u-sYg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148469"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148469/Application_Of_Extended_Fuzzy_Programming_Technique_To_A_Real_Life_Transportation_Problem_In_Neutrosophic_Environment"><img alt="Research paper thumbnail of Application Of Extended Fuzzy Programming Technique To A Real Life Transportation Problem In Neutrosophic Environment" class="work-thumbnail" src="https://attachments.academia-assets.com/95235257/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148469/Application_Of_Extended_Fuzzy_Programming_Technique_To_A_Real_Life_Transportation_Problem_In_Neutrosophic_Environment">Application Of Extended Fuzzy Programming Technique To A Real Life Transportation Problem In Neutrosophic Environment</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">This paper focuses on solving the transportation problems with neutrosophic data for the first ti...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">This paper focuses on solving the transportation problems with neutrosophic data for the first time. The indeterminacy factor has been considered in Transportation Problems (TP). The two methods of linear programming – Fuzzy Linear Programming (FLP) and Crisp Linear Programming (CLP) are discussed with reference to neutrosophic transportation problems. The first method uses the membership, non-membership and indeterminacy degrees separately to find the crisp solution using the Fuzzy Programming Technique and then the optimal solution is calculated in terms of neutrosophic data with the help of defined cost membership functions. The satisfaction degree is then calculated to check the better solution.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="728c73bfcd02c6c11cbccb0b22939939" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235257,"asset_id":92148469,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235257/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148469"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148469"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148469; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148469]").text(description); $(".js-view-count[data-work-id=92148469]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148469; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148469']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "728c73bfcd02c6c11cbccb0b22939939" } } $('.js-work-strip[data-work-id=92148469]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148469,"title":"Application Of Extended Fuzzy Programming Technique To A Real Life Transportation Problem In Neutrosophic Environment","internal_url":"https://www.academia.edu/92148469/Application_Of_Extended_Fuzzy_Programming_Technique_To_A_Real_Life_Transportation_Problem_In_Neutrosophic_Environment","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235257,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235257/thumbnails/1.jpg","file_name":"ApplicationOfExtendedFuzzyProgrammingTechnique.pdf","download_url":"https://www.academia.edu/attachments/95235257/download_file","bulk_download_file_name":"Application_Of_Extended_Fuzzy_Programmin.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235257/ApplicationOfExtendedFuzzyProgrammingTechnique-libre.pdf?1670148656=\u0026response-content-disposition=attachment%3B+filename%3DApplication_Of_Extended_Fuzzy_Programmin.pdf\u0026Expires=1740004425\u0026Signature=T4BLFe75UyrSLnXII2GozTUgBb9b7izeuEpJi3vlrcG1SCMPJtSDQGAqW-IBVTAYFJD-eTtm1l66R5x5Ivywxlv9LZELheb9BdfXU2Hjp3qC-lLTbU-zTI3uZRV5jL48XMml8opsjOWqE2laElYiLTpZhKjuQqjI8V6rjsTbW0j7tLM5v2feIVAmWvE7fuG5lGctrcH6t96TAeH4hmohbZre1gxzarKMerIH4pwAM9hFbi~IfUkUZ~zfn~HnzvXpnenFSxHzj4kb3-5J2j2weAukeotDgF6kjvlnsKsA550Ckbc2Sd7VBJivjZHU9R4uqw6bFJPFa3PQ6ZUaMeqyTw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148468"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148468/Solution_Of_Multi_Criteria_Assignment_Problem_Using_Neutrosophic_Set_Theory"><img alt="Research paper thumbnail of Solution Of Multi-Criteria Assignment Problem Using Neutrosophic Set Theory" class="work-thumbnail" src="https://attachments.academia-assets.com/95235256/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148468/Solution_Of_Multi_Criteria_Assignment_Problem_Using_Neutrosophic_Set_Theory">Solution Of Multi-Criteria Assignment Problem Using Neutrosophic Set Theory</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Assignment Problem (AP) is a very well-known and also useful decision making problem in real life...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Assignment Problem (AP) is a very well-known and also useful decision making problem in real life situations. It becomes more effective when different criteria are added. To solve Multi-Criteria Assignment Problem (MCAP), the different criteria have been considered as neutrosophic elements because Neutrosophic Set Theory (NST) is a generalization of the classical sets, conventional fuzzy sets, Intuitionistic Fuzzy Sets (IFS) and Interval Valued Fuzzy Sets (IVFS). In this paper two different methods have been proposed for solving MCAP.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="df7da37550326fa1336d5812af204fb8" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235256,"asset_id":92148468,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235256/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148468"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148468"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148468; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148468]").text(description); $(".js-view-count[data-work-id=92148468]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148468; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148468']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "df7da37550326fa1336d5812af204fb8" } } $('.js-work-strip[data-work-id=92148468]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148468,"title":"Solution Of Multi-Criteria Assignment Problem Using Neutrosophic Set Theory","internal_url":"https://www.academia.edu/92148468/Solution_Of_Multi_Criteria_Assignment_Problem_Using_Neutrosophic_Set_Theory","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235256,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235256/thumbnails/1.jpg","file_name":"SolutionOfMultiCriteriaAssignmentProblem.pdf","download_url":"https://www.academia.edu/attachments/95235256/download_file","bulk_download_file_name":"Solution_Of_Multi_Criteria_Assignment_Pr.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235256/SolutionOfMultiCriteriaAssignmentProblem-libre.pdf?1670148666=\u0026response-content-disposition=attachment%3B+filename%3DSolution_Of_Multi_Criteria_Assignment_Pr.pdf\u0026Expires=1740004425\u0026Signature=Mvzqj-5borR0M75wVxsEecChwzzJ9Q~LoJmtu3XZjOBik39c5d7JV0COp4ZEjXWQsqd3e8d2ttIgBMuKtpyf6Hpou7IXkYcfuCFNuBe9KaSw9fi2fc1rZuGCc48bJUKRmQCcRFaYd0ELGTA9u341CZn2zZgPTQB8IfGRGMcBXZRxvWebvwpg-5Vr9hwUp8Ais-fEs4QZbs4Lh9JxCOJ6PK2nFqPsCWWzfra6GBwA7BCGG5h9j8DjtXNHoVyWO2ZiANvodVaNFOJ4QsXJD6szDDQzSCv6RoiSIJJ9IPHcsSMcH-1yZ97qkCZSbOQ6LRn1oS~1GccYxNXb2nIbTf7euw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148467"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148467/Annals_of_Multiple_Fuzzy_Regression_Model_on_Two_Wheelers_Mileage_with_Several_independent_Factors"><img alt="Research paper thumbnail of Annals of Multiple Fuzzy Regression Model on Two Wheelers’ Mileage with Several independent Factors" class="work-thumbnail" src="https://attachments.academia-assets.com/95235254/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148467/Annals_of_Multiple_Fuzzy_Regression_Model_on_Two_Wheelers_Mileage_with_Several_independent_Factors">Annals of Multiple Fuzzy Regression Model on Two Wheelers’ Mileage with Several independent Factors</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Abstract. Regression is one of the important factors of statistical analysis. But the application...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Abstract. Regression is one of the important factors of statistical analysis. But the applications of statistical regression are bounded by the quantitative aspects. It is one of the major drawbacks of normal regression. Because real life applications are mostly based on uncertain interval estimation, than certain point estimation. Fuzzy logic is one of the best ways to deal with such problems. Here in this paper a fuzzy linear multiple regression analysis has been done on the mileage of two wheeler’s with several independent factors. In this multiple linear fuzzy regression model input data has been taken in two aspects, one is crisp another is triangular fuzzy data.Statistical level of significance is taken as membership values, ranges from 0 to 1. Defuzzification technique is used to generate the crisp mileage. In this entire work MATLAB, SPSS, MAPLE 6 are used for statistical calculation.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="f51b8121cba2fbb9c9a99744c4e22bed" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235254,"asset_id":92148467,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235254/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148467"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148467"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148467; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148467]").text(description); $(".js-view-count[data-work-id=92148467]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148467; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148467']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "f51b8121cba2fbb9c9a99744c4e22bed" } } $('.js-work-strip[data-work-id=92148467]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148467,"title":"Annals of Multiple Fuzzy Regression Model on Two Wheelers’ Mileage with Several independent Factors","internal_url":"https://www.academia.edu/92148467/Annals_of_Multiple_Fuzzy_Regression_Model_on_Two_Wheelers_Mileage_with_Several_independent_Factors","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235254,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235254/thumbnails/1.jpg","file_name":"apam-v5n1-11.pdf","download_url":"https://www.academia.edu/attachments/95235254/download_file","bulk_download_file_name":"Annals_of_Multiple_Fuzzy_Regression_Mode.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235254/apam-v5n1-11-libre.pdf?1670148662=\u0026response-content-disposition=attachment%3B+filename%3DAnnals_of_Multiple_Fuzzy_Regression_Mode.pdf\u0026Expires=1740004425\u0026Signature=TAbgICUENfiJHHno8pJ6XP7QDQ9THGw-XcywRzK9YhTZ9nOoTKY46OdHw4yMrJf~ScY5voJoDG7Vlazq9twDQpgkPbG0fNjLJ8I0nH1d9vpPwpwzp44J76nyaiv3aocLcHSM3xoHFEaqHfs1Ywj1-4iymP36sQGKa71GHXKP8rnlHF1EpTpiMlW2ozyGPr2QafLOcbHMqMG2B~zbdl0VOVZN2OZG2BwQbW1kredTbmGlFlRvfqaU-kGIukaEc8HjeEkMWrzqOC4nrkQHFJpV4ROCgT~qfrNH9rv3QcC9AM5rOTRR32EDgzHEML7eUNm2n241MSpxWKNFqT43vZvMIQ__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148466"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148466/Selection_of_Transportation_Companies_and_Their_Mode_of_Transportation_for_Interval_Valued_Data"><img alt="Research paper thumbnail of Selection of Transportation Companies and Their Mode of Transportation for Interval Valued Data" class="work-thumbnail" src="https://attachments.academia-assets.com/95235258/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148466/Selection_of_Transportation_Companies_and_Their_Mode_of_Transportation_for_Interval_Valued_Data">Selection of Transportation Companies and Their Mode of Transportation for Interval Valued Data</a></div><div class="wp-workCard_item"><span>viXra</span><span>, 2018</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The paper presents selection of transportation companies and their mode of transportation for int...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The paper presents selection of transportation companies and their mode of transportation for interval valued neutrosophic data. The paper focuses on the application of distance measures to select mode of transportation for transportation companies. The paper also presents the application of multi-criteria decision making method using weighted correlation coefficient and extended TOPSIS for transportation companies.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="1531a31debbcce61de5b1d975c509cd6" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235258,"asset_id":92148466,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235258/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148466"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148466"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148466; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148466]").text(description); $(".js-view-count[data-work-id=92148466]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148466; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148466']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "1531a31debbcce61de5b1d975c509cd6" } } $('.js-work-strip[data-work-id=92148466]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148466,"title":"Selection of Transportation Companies and Their Mode of Transportation for Interval Valued Data","internal_url":"https://www.academia.edu/92148466/Selection_of_Transportation_Companies_and_Their_Mode_of_Transportation_for_Interval_Valued_Data","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235258,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235258/thumbnails/1.jpg","file_name":"SelectionOfTransportation.pdf","download_url":"https://www.academia.edu/attachments/95235258/download_file","bulk_download_file_name":"Selection_of_Transportation_Companies_an.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235258/SelectionOfTransportation-libre.pdf?1670148673=\u0026response-content-disposition=attachment%3B+filename%3DSelection_of_Transportation_Companies_an.pdf\u0026Expires=1740004425\u0026Signature=T7~dkC6csAj3z9iOw~i~jcyKgtUDkYqsLs6xJcdzV3GW1PfxsTAiPRYt~QkbaFAgTy3K5r7vqUE5P0t-TJdgA7CPTEEvZ2gr97SO0VKB586Dv7oFzUVRiJs8~Rxzpu3j3lqO5H21W34Wz4DI0duVt0bUWkA2AO7SpqkBZvYgiYp9x1VWwjOCndsB-cwKcm0VI~WgTE5k5aJtAXRbUPcAk1Q3UeyWUIx6uIv50jTCzWe9wtKchbpNElL2djtvlPvyteIjrjQhbMLyA2V-PTFZrPQFfAQed6~0pbSxkU~gUJuKJg3HXn343r8s5XwiMkk46SiUCvj~CYjNhEz7uaut1Q__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148465"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148465/A_Study_to_Make_a_Clustering_of_Website_Attributes_on_User_Interface_to_Increase_the_Effectiveness_of_Indian_Educational_Websites"><img alt="Research paper thumbnail of A Study to Make a Clustering of Website Attributes on User Interface to Increase the Effectiveness of Indian Educational Websites" class="work-thumbnail" src="https://attachments.academia-assets.com/95235255/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148465/A_Study_to_Make_a_Clustering_of_Website_Attributes_on_User_Interface_to_Increase_the_Effectiveness_of_Indian_Educational_Websites">A Study to Make a Clustering of Website Attributes on User Interface to Increase the Effectiveness of Indian Educational Websites</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The effectiveness of distance learning websites has an impact on higher education of the particul...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The effectiveness of distance learning websites has an impact on higher education of the particular region. The socioeconomic structure of the people of a particular area has an impact on the enrollment as well as continuation of the study in higher education. The user feedback of students about different barriers to get enrolled in higher education has been taken. In this paper an attempt has been made to map the real problems with facilities that can be provided by educational websites. The possible ways to overcome these problems by increasing the effectiveness of educational websites by clustering the attributes of them have been presented in this study. In this study problem centric clusters of website attributes to increase the effectiveness of websites are made.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="91ea566def0e19d0d2386e1ad4ec2c56" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235255,"asset_id":92148465,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235255/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148465"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148465"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148465; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148465]").text(description); $(".js-view-count[data-work-id=92148465]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148465; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148465']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "91ea566def0e19d0d2386e1ad4ec2c56" } } $('.js-work-strip[data-work-id=92148465]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148465,"title":"A Study to Make a Clustering of Website Attributes on User Interface to Increase the Effectiveness of Indian Educational Websites","internal_url":"https://www.academia.edu/92148465/A_Study_to_Make_a_Clustering_of_Website_Attributes_on_User_Interface_to_Increase_the_Effectiveness_of_Indian_Educational_Websites","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235255,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235255/thumbnails/1.jpg","file_name":"7.pdf","download_url":"https://www.academia.edu/attachments/95235255/download_file","bulk_download_file_name":"A_Study_to_Make_a_Clustering_of_Website.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235255/7-libre.pdf?1670148653=\u0026response-content-disposition=attachment%3B+filename%3DA_Study_to_Make_a_Clustering_of_Website.pdf\u0026Expires=1740004426\u0026Signature=bJSm3M~muz598Nn3BL1ctNxBO9alk5bfXEU37jvpesjOwUae8TyB8szL72zy5ADMh~Rq~aZYbFriAzwEJpVpUlet8LiUrnONBX~TzrQa5pZSUbFcpwbHQYRK~--cAuJkO0l~3aozoXA78yRqkOnASNY-ZxuiUTZVLKxRzP6xExCJeEsmVYRV83yHB4ZyXjjDFYUcFCHQgMAXasWUq91z-VpLvnGTR3BU7AW-z6T~aGBgUYHVHDsrisqIw7TbZ-eFE9hyCWhJYVVsDFyeXJRKaDgTA7WjgnaWCklytiKnoVpdYKglejgnQTW~YkLBvebLCzcrTeZWh2zPGajrb63sAg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148464"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148464/A_Survey_on_E_Learning_Attributes_of_University_Websites_of_Different_Countries"><img alt="Research paper thumbnail of A Survey on E-Learning Attributes of University Websites of Different Countries" class="work-thumbnail" src="https://attachments.academia-assets.com/95235264/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148464/A_Survey_on_E_Learning_Attributes_of_University_Websites_of_Different_Countries">A Survey on E-Learning Attributes of University Websites of Different Countries</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">E-learning, has revolutionized the style of learning. Now learning material is available within t...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">E-learning, has revolutionized the style of learning. Now learning material is available within the reach of students who want to continue higher education. Besides this, distance learning system is getting popularity in different countries. Website can play a vital role in case of providing different on-line services to the students. The incorporation of several facilities in educational websites can remove different problems. So the effectiveness of educational websites needs to be increased when ever required. Mainly this incorporation is required in the countries where enrollment ratio in higher education is very low. LITERATURE REVIEW A research on the use of websites to make parents involved in education and whether it is effective or not is discussed by Yoon J in the year 2004 .A work on the development of effective educational website by integrating principle of active learning with the unique feature of the web was done by David A cook in the year 2004.A work on how educati...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="c0f7fe9c09943cbbae4a401af94d76d0" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235264,"asset_id":92148464,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235264/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148464"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148464"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148464; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148464]").text(description); $(".js-view-count[data-work-id=92148464]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148464; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148464']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "c0f7fe9c09943cbbae4a401af94d76d0" } } $('.js-work-strip[data-work-id=92148464]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148464,"title":"A Survey on E-Learning Attributes of University Websites of Different Countries","internal_url":"https://www.academia.edu/92148464/A_Survey_on_E_Learning_Attributes_of_University_Websites_of_Different_Countries","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235264,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235264/thumbnails/1.jpg","file_name":"3.pdf","download_url":"https://www.academia.edu/attachments/95235264/download_file","bulk_download_file_name":"A_Survey_on_E_Learning_Attributes_of_Uni.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235264/3-libre.pdf?1670148660=\u0026response-content-disposition=attachment%3B+filename%3DA_Survey_on_E_Learning_Attributes_of_Uni.pdf\u0026Expires=1740004426\u0026Signature=Y-W53lMrgYS4WE5N~APlCl8NIyMlv7Fra4RkhXwjzsVIxgxikLMpcCoQof3CJowO4bCwQQWlN3~Lxvch1WjV1gUVzf1Kj-c2Dq6ryDfM9yLPAOtBP43yNtiafa~1V0UKht7bg1rU-tP6iDocRcSJmhUIFcnxLC8Kzq4WkRKl99-QxLuC3yFeHiRsYUwHuU2nQlexbdgOEV~uDQ3tUG0jMRL8cdPIGBVgGDHouAu-G-E85PMYKGE0F~OR3B0XphqdXv53jTnLz3qveoDh07~hl9lCdRCZnQVKybYIyi6uOM4ugjrdS~n60ZbnzcL10U~83KdcKZ7dJBEMd6KgP81G9g__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148463"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/92148463/A_Prioritized_Decision_Making_Method_for_Reliability_Allocation_in_Optimistic_and_Pessimistic_View"><img alt="Research paper thumbnail of A Prioritized Decision Making Method for Reliability Allocation: in Optimistic and Pessimistic View" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/92148463/A_Prioritized_Decision_Making_Method_for_Reliability_Allocation_in_Optimistic_and_Pessimistic_View">A Prioritized Decision Making Method for Reliability Allocation: in Optimistic and Pessimistic View</a></div><div class="wp-workCard_item"><span>Journal of Integrated Design and Process Science</span><span>, 2021</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Reliability allocation is a very important problem during early design and development phases of ...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Reliability allocation is a very important problem during early design and development phases of a system. There are several reliability allocation techniques which are used to achieve the target reliability. The feasibility of objectives (FOO) technique is one of them that is widely used to perform system reliability allocation. But this technique has two fundamental shortcomings. The first is the measurement scale and the second is that it does not consider the order weight of the reliability allocation factors. The prioritization of the factors is also an important topic in decision making. Practically, all factors in multi-criteria decision making (MCDM) are not in the same priority level. Hence, in decision making situation, it is usual for decision makers to consider different priority factors. So, considering the prioritization of the factors, a reliability allocation method is proposed here to overcome the shortcomings of the FOO technique. Also, a case study on reliability ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148463"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148463"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148463; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148463]").text(description); $(".js-view-count[data-work-id=92148463]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148463; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148463']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=92148463]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148463,"title":"A Prioritized Decision Making Method for Reliability Allocation: in Optimistic and Pessimistic View","internal_url":"https://www.academia.edu/92148463/A_Prioritized_Decision_Making_Method_for_Reliability_Allocation_in_Optimistic_and_Pessimistic_View","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148462"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148462/Lattice_signatures_using_NTRU_on_the_hardness_of_worst_case_ideal_lattice_problems"><img alt="Research paper thumbnail of Lattice signatures using NTRU on the hardness of worst-case ideal lattice problems" class="work-thumbnail" src="https://attachments.academia-assets.com/95235253/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148462/Lattice_signatures_using_NTRU_on_the_hardness_of_worst_case_ideal_lattice_problems">Lattice signatures using NTRU on the hardness of worst-case ideal lattice problems</a></div><div class="wp-workCard_item"><span>IET Information Security</span><span>, 2020</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Recently, lattice signatures based on the Fiat-Shamir framework have seen a lot of improvements w...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Recently, lattice signatures based on the Fiat-Shamir framework have seen a lot of improvements which are efficient in practice. The security of these signature schemes depends mainly on the hardness of solving short integer solutions (SIS) and/or learning with errors problem in the random oracle model. The authors propose an alternative lattice-based signature scheme on the Fiat-Shamir framework over the ring ℤ[x]/(x n + 1). The key generation in the signature scheme is based on the combination of NTRU and Ring SIS like key generation. Both the signature and the verification are done efficiently by doing polynomial convolutions in the ring ℤ[x]/(x n + 1). The proposed signature scheme is provably secure based on the hardness of the Ring SIS problem in the random oracle model. The scheme is also efficient up to constant factors as the highly practical schemes which have provable secure instantiation.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="3605633d01dba11d6021632e42b1f56a" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235253,"asset_id":92148462,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235253/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148462"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148462"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148462; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148462]").text(description); $(".js-view-count[data-work-id=92148462]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148462; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148462']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "3605633d01dba11d6021632e42b1f56a" } } $('.js-work-strip[data-work-id=92148462]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148462,"title":"Lattice signatures using NTRU on the hardness of worst-case ideal lattice problems","internal_url":"https://www.academia.edu/92148462/Lattice_signatures_using_NTRU_on_the_hardness_of_worst_case_ideal_lattice_problems","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235253,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235253/thumbnails/1.jpg","file_name":"iet-ifs.2019.pdf","download_url":"https://www.academia.edu/attachments/95235253/download_file","bulk_download_file_name":"Lattice_signatures_using_NTRU_on_the_har.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235253/iet-ifs.2019-libre.pdf?1670148680=\u0026response-content-disposition=attachment%3B+filename%3DLattice_signatures_using_NTRU_on_the_har.pdf\u0026Expires=1740004426\u0026Signature=Ex8-CfU1sDUju3YikEogcTxn1TLqKcOIqBskj5hpWaFj90hGjtL4~BLSDiJm8R5MBiJ-DuZ03l2A8Xbw55UUPT1R24RhvZq6JxrdxiSkz2uYztKYO8nDztOSeW6~7uJbPoE2k-8Rq3PAkpeVy~Ujf1NIpM4KeY-ERhfbg9oRkzs0uTNmWC3kb4xqpLjzvnPSqRKjXxK5OP8khkE2lEvBfWvXfiMpbF~9VvzOV2eER01Sw5cG7C5-ddTdnru0AmnSGEyo6v31tLvgkL7loTm3tgw8KZzd9BeXwM5Tat7T3bqyPhrSzU0tqsYvoX~jPdxd~crW0IY-mGy1JYDyiO59fQ__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148461"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148461/An_attraction_based_particle_swarm_optimization_for_solving_multi_objective_availability_allocation_problem_under_uncertain_environment"><img alt="Research paper thumbnail of An attraction based particle swarm optimization for solving multi-objective availability allocation problem under uncertain environment" class="work-thumbnail" src="https://attachments.academia-assets.com/95235262/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148461/An_attraction_based_particle_swarm_optimization_for_solving_multi_objective_availability_allocation_problem_under_uncertain_environment">An attraction based particle swarm optimization for solving multi-objective availability allocation problem under uncertain environment</a></div><div class="wp-workCard_item"><span>Journal of Intelligent & Fuzzy Systems</span><span>, 2018</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Reliability optimization and availability optimization are two classes of optimization problems i...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Reliability optimization and availability optimization are two classes of optimization problems in redundancy allocation problem (RAP). Contrary to reliability optimization, very few researchers have focused on availability optimization to find out the optimal redundancy. This paper proposes a multi-objective optimization problem of availability allocation in a series-parallel system with repairable components. The two objectives are maximizing the system availability and minimizing the total cost of the system. In real life situation, due to complexity of the systems and non-linearity of their behaviour, most of the data are usually uncertain and imprecise. Hence in order to make the model more reliable, fuzzy theory has been introduced in terms of triangular data for handling the uncertainties. Thus in fuzzy environment a fuzzy multi-objective availability allocation problem is formulated. In order to solve the problem a crisp optimization problem has been reformulated using fuzzy programming technique and finally an attraction based particle swarm optimization (APSO) has been proposed to solve this crisp optimization problem. The proposed APSO is compared with the traditional Particle swarm optimization(PSO) to show the efficiency and consistency of the proposed approach. Based on a numerical example,the statistical analysis of the experimental results establish that the proposed APSO has a better and consistent performance compared to traditional PSO.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="bcd50182245034321667e563abf7a076" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235262,"asset_id":92148461,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235262/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148461"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148461"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148461; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148461]").text(description); $(".js-view-count[data-work-id=92148461]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148461; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148461']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "bcd50182245034321667e563abf7a076" } } $('.js-work-strip[data-work-id=92148461]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148461,"title":"An attraction based particle swarm optimization for solving multi-objective availability allocation problem under uncertain environment","internal_url":"https://www.academia.edu/92148461/An_attraction_based_particle_swarm_optimization_for_solving_multi_objective_availability_allocation_problem_under_uncertain_environment","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235262,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235262/thumbnails/1.jpg","file_name":"JIFS-1802920221204-1-13xg6te.pdf","download_url":"https://www.academia.edu/attachments/95235262/download_file","bulk_download_file_name":"An_attraction_based_particle_swarm_optim.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235262/JIFS-1802920221204-1-13xg6te-libre.pdf?1670148663=\u0026response-content-disposition=attachment%3B+filename%3DAn_attraction_based_particle_swarm_optim.pdf\u0026Expires=1740004426\u0026Signature=Za1BZAJpnVyMm6Uyr9Z5tIr6AbbVcfQ~ZPEt35CvwoLGrJHDg0Az5wNtM3J-jOG5UEmujflZmWVbriYIuOh9Ekt9QAXcpnYBuE-1vEZG6edsyXMxi9X1tpYZLgq-zQ32ylUxlXFUbkl610YuEo1bDBzFL2A1pJ8ZUbsBDxSIL7BLHogq182Ky37pd8l~yQr1iBM6GEQmBbqP4e3ktcnkkrnJbGS~H1igPEGoQkcwsceTDectUC7YkMqli4e-Hp~P5-1BFayV1Li3QJRcEqqrHjaea21EAbzBIJ8hr-0iGwl4Htyzb5bvXk2S-yhEwMWpeRbEuTMdeeDblFIrrL410A__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148460"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148460/Development_of_Estimation_Procedure_of_Population_Mean_in_Two_Phase_Stratified_Sampling"><img alt="Research paper thumbnail of Development of Estimation Procedure of Population Mean in Two-Phase Stratified Sampling" class="work-thumbnail" src="https://attachments.academia-assets.com/95235220/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148460/Development_of_Estimation_Procedure_of_Population_Mean_in_Two_Phase_Stratified_Sampling">Development of Estimation Procedure of Population Mean in Two-Phase Stratified Sampling</a></div><div class="wp-workCard_item"><span>Statistical Methodologies [Working Title]</span><span>, 2019</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">This article describes the problem of estimation of finite population mean in two-phase stratifie...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">This article describes the problem of estimation of finite population mean in two-phase stratified random sampling. Using information on two auxiliary variables, a class of product to regression chain type estimators has been proposed and its characteristic is discussed. The unbiased version of the proposed class of estimators has been constructed and the optimality condition for the proposed class of estimators is derived. The efficacy of the proposed methodology has been justified through empirical investigations carried over the data set of natural population as well as the data set of artificially generated population. The survey statistician may be suggested to use it.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="35b26b717122394fdd1880ad228fc304" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235220,"asset_id":92148460,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235220/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148460"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148460"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148460; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148460]").text(description); $(".js-view-count[data-work-id=92148460]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148460; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148460']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "35b26b717122394fdd1880ad228fc304" } } $('.js-work-strip[data-work-id=92148460]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148460,"title":"Development of Estimation Procedure of Population Mean in Two-Phase Stratified Sampling","internal_url":"https://www.academia.edu/92148460/Development_of_Estimation_Procedure_of_Population_Mean_in_Two_Phase_Stratified_Sampling","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235220,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235220/thumbnails/1.jpg","file_name":"65113.pdf","download_url":"https://www.academia.edu/attachments/95235220/download_file","bulk_download_file_name":"Development_of_Estimation_Procedure_of_P.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235220/65113-libre.pdf?1670148666=\u0026response-content-disposition=attachment%3B+filename%3DDevelopment_of_Estimation_Procedure_of_P.pdf\u0026Expires=1740004426\u0026Signature=UKC8IWyF5EmvqSWcSHNSHGIu705CV7SZse-3b5qHTG0yr41-UcQPDN0s-7XXm6XZ4fWOYA2CHOV7aeDXhMNZ1lmi2AAKSGc5uoIfJOkXwaW-EK8YpNhai43DeyoesaMkroFtO2ekdgE7z7mYADPtDDU~YQsQCTkSlCygwm23suRkCuF2nXsSmN70Lgn9c3niF1mCLBgK8M6CGpkMaZw9ay08dXmJC3Okrt4aKetpkV4J8WNp0yYU9VoXKm7Tt4p3KhJkxIIpCRobzo1JV1dMj8Nm9VKC608QhNpNsdp86hz-9iZHnEpuG4s0gD4LQFyW9kF6mH3Q2UEox9yp2mUw9Q__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"},{"id":95235219,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235219/thumbnails/1.jpg","file_name":"65113.pdf","download_url":"https://www.academia.edu/attachments/95235219/download_file","bulk_download_file_name":"Development_of_Estimation_Procedure_of_P.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235219/65113-libre.pdf?1670148665=\u0026response-content-disposition=attachment%3B+filename%3DDevelopment_of_Estimation_Procedure_of_P.pdf\u0026Expires=1740004426\u0026Signature=JlvuoirdyDJFs9lRYei1s~onLmUNoEQ8LhV1KyEmfHMlSNLfBv2kQz5L3rh8rgjHWCgoVUC2YXm0rRFTqfDkPVGdh4At~rfHrCx9fVQ-VXczX8ZfCObjSOPKqjTgh5HKU1OOtEn8o7DZL~yPcge8jx2qDinRH2vQsfrkzc69Nru~JqJ34HfSdskWjwXXLszbqTP4i4z0He584iBSX1nR5nixupFJhbVtMTf2CVTy6mxkZRjHJmDJuo4Ts4i041VYPyWTotXKjjTy3BONOlVwZ5ZO8N6GZFcfI4Snt2bjc4DH-hYcaMOLS4qoCJNPKdWLWBRtbasdbNx6xsOEJBlhog__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148459"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148459/Vector_aggregation_operator_and_score_function_to_solve_multi_criteria_decision_making_problem_in_neutrosophic_environment"><img alt="Research paper thumbnail of Vector aggregation operator and score function to solve multi-criteria decision making problem in neutrosophic environment" class="work-thumbnail" src="https://attachments.academia-assets.com/95235261/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148459/Vector_aggregation_operator_and_score_function_to_solve_multi_criteria_decision_making_problem_in_neutrosophic_environment">Vector aggregation operator and score function to solve multi-criteria decision making problem in neutrosophic environment</a></div><div class="wp-workCard_item"><span>International Journal of Machine Learning and Cybernetics</span><span>, 2018</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">In our real world there exist uncertain, imprecise, incomplete, and inconsistent information. Tho...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">In our real world there exist uncertain, imprecise, incomplete, and inconsistent information. Those kinds of information can be suitably handled by neutrosophic fuzzy set as it is the generalization of classic set, fuzzy set and intuitionistic fuzzy set. The uncertain, imprecise, incomplete and inconsistent information provided by several sources need to be aggregated to come to a conclusion. Aggregation and fusion of information are basic concerns for all kinds of knowledge based systems. The main purpose of this paper is to aggregate neutrosophic fuzzy information by introducing a new aggregation operator in vector approach. The new approach is simple based on basic vector operations and reliable as it will always give a meaningful result. Also a new vector score function has been defined to compare the neutrosophic fuzzy numbers and explained through geometrical interpretation. The newly proposed vector score function always gives different values for any two different neutrosophic numbers. Further, a multiple-criteria decision-making method is established on the basis of the proposed operator and newly defined score function.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="5956119997c1b14845d77d45e399e530" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235261,"asset_id":92148459,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235261/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148459"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148459"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148459; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148459]").text(description); $(".js-view-count[data-work-id=92148459]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148459; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148459']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "5956119997c1b14845d77d45e399e530" } } $('.js-work-strip[data-work-id=92148459]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148459,"title":"Vector aggregation operator and score function to solve multi-criteria decision making problem in neutrosophic environment","internal_url":"https://www.academia.edu/92148459/Vector_aggregation_operator_and_score_function_to_solve_multi_criteria_decision_making_problem_in_neutrosophic_environment","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235261,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235261/thumbnails/1.jpg","file_name":"s13042-018-0819-420221204-1-1btj25l.pdf","download_url":"https://www.academia.edu/attachments/95235261/download_file","bulk_download_file_name":"Vector_aggregation_operator_and_score_fu.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235261/s13042-018-0819-420221204-1-1btj25l-libre.pdf?1670148988=\u0026response-content-disposition=attachment%3B+filename%3DVector_aggregation_operator_and_score_fu.pdf\u0026Expires=1740004426\u0026Signature=LSTvbgHhfkJm2u5KmSQ44Gp6~uTkMCXOMcGr65emwp~~q0xl8uMnL0OgWxxobp01l61bmiRGmm49RYOShMLt8lIcYSjaQk4rKXA-IOE0zgVhxt2hCThs1DNZxvhlSXCfS-p1celY7tKGoXZ-tiow6KuGTo7m3t3eumZ39aiVIF3tK9LblF5N0mEkoT4JNuB4J5uQcqznREsttoj1BxTOOT~NHTtt4ikVjhCn4EGBwevk8ZTNqWsmoNpjck4d-KcUZkLtv18kaS0VvtrAaHkQzpkIWVOekhMQooJXHLSsJUO7flzks-uE1yl4~yJ3fCPYBvj5kvfK2b2icLDUYbVfDQ__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148458"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148458/Solution_of_a_class_of_generalized_assignment_problem"><img alt="Research paper thumbnail of Solution of a class of generalized assignment problem" class="work-thumbnail" src="https://attachments.academia-assets.com/95235263/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148458/Solution_of_a_class_of_generalized_assignment_problem">Solution of a class of generalized assignment problem</a></div><div class="wp-workCard_item"><span>Journal of Intelligent & Fuzzy Systems</span><span>, 2017</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The paper presents the solution of a multi objective multi-index generalized assignment problem u...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The paper presents the solution of a multi objective multi-index generalized assignment problem using Fuzzy Programming Technique which is a new concept. It emphasizes on minimization of the job cost and time at different sites where the jobs are being performed using different machines (medium). Multi objective assignment problem or multi objective generalized assignment problem have been solved in different ways by different mathematicians. But they have considered only two indices (jobs and alternatives). Here we have considered more than two indices and so it becomes a multi-index generalized assignment problem which makes it superior to the previous methods. This type of problem has not been solved earlier by our proposed method. Moreover in this paper Fuzzy Programming Technique has been used considering linear, exponential and hyperbolic (non-linear) membership functions for getting optimal solutions. Finally a real life application has been presented.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="76ad3219b82c18f120295ea27f8cd8a7" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235263,"asset_id":92148458,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235263/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148458"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148458"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148458; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148458]").text(description); $(".js-view-count[data-work-id=92148458]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148458; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148458']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "76ad3219b82c18f120295ea27f8cd8a7" } } $('.js-work-strip[data-work-id=92148458]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148458,"title":"Solution of a class of generalized assignment problem","internal_url":"https://www.academia.edu/92148458/Solution_of_a_class_of_generalized_assignment_problem","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235263,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235263/thumbnails/1.jpg","file_name":"JIFS-1708620221204-1-6gb8oa.pdf","download_url":"https://www.academia.edu/attachments/95235263/download_file","bulk_download_file_name":"Solution_of_a_class_of_generalized_assig.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235263/JIFS-1708620221204-1-6gb8oa-libre.pdf?1670148657=\u0026response-content-disposition=attachment%3B+filename%3DSolution_of_a_class_of_generalized_assig.pdf\u0026Expires=1740004426\u0026Signature=YvhAJ7dt1kn51VXvq2AZ2hv1ghWqH~ZTt6y2KT3vpNvUxOkBzZlwOg6lptwrBHmPOtLG9fY3md-No4WJD36DcjJ4cnY-Xui8FQeCiDyvh02vH3mMx~kSGKJC3J7cFK6QEHbOrTXsRXInk6ypR5FbV53cAsJcLbjiac-CUJLam29metGTNVqtxwBO0meVUEt9pO-ysXSqiHbmsRCD9xG83Mn37rxlIRjS4abmxfc-uypCJbLramFswm9w1awQHLseGEK3nq~VFpMDH2hkG0TDkmx08Buvjx1d0ThOGQGsFlx5WFbrNHAK1iaYJwsLcFq6Ux88aCh~bftMD39g7V~Gag__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148457"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148457/Solving_intuitionistic_fuzzy_transportation_problem_using_linear_programming"><img alt="Research paper thumbnail of Solving intuitionistic fuzzy transportation problem using linear programming" class="work-thumbnail" src="https://attachments.academia-assets.com/95235250/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148457/Solving_intuitionistic_fuzzy_transportation_problem_using_linear_programming">Solving intuitionistic fuzzy transportation problem using linear programming</a></div><div class="wp-workCard_item"><span>International Journal of System Assurance Engineering and Management</span><span>, 2017</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="ac3daf2e0fe1308ce6ac6e196b16fe46" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235250,"asset_id":92148457,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235250/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148457"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148457"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148457; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148457]").text(description); $(".js-view-count[data-work-id=92148457]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148457; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148457']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "ac3daf2e0fe1308ce6ac6e196b16fe46" } } $('.js-work-strip[data-work-id=92148457]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148457,"title":"Solving intuitionistic fuzzy transportation problem using linear programming","internal_url":"https://www.academia.edu/92148457/Solving_intuitionistic_fuzzy_transportation_problem_using_linear_programming","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235250,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235250/thumbnails/1.jpg","file_name":"s13198-017-0575-y20221204-1-1c62l49.pdf","download_url":"https://www.academia.edu/attachments/95235250/download_file","bulk_download_file_name":"Solving_intuitionistic_fuzzy_transportat.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235250/s13198-017-0575-y20221204-1-1c62l49-libre.pdf?1670148667=\u0026response-content-disposition=attachment%3B+filename%3DSolving_intuitionistic_fuzzy_transportat.pdf\u0026Expires=1740004426\u0026Signature=RZekFVsHdF~1F8qR32matdtwOflCwIqdgTXwwys-BLdHdIjFHXI7lj7IQq76-k3OFSfkpmSb2bBOmVFHsLz~JIWL5twHnY-~ni0eak3Y4yNz1ypgOcCQKAhq9O0rwd3vqsoh9pelxiTPSoK4M~-IhSHAMcvL~Bl~q3qYhsRii7mYv-nwofQcjcpZOG-uaiXWrWeHD6fMS~vk1X1wUBbOYNrZvTD6~wWwT5kAu-Y-wNAsHCSeG8oXFmIDt0tDhjKUWQ34gUVo72tVOvEnr1jbNEiVano0cA2sgCAw5eriNbOIKr7sOOgzaq3Nsvow61iJgjgGzT2TASRz4cA03OgCjg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148456"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148456/Improved_similarity_measure_in_neutrosophic_environment_and_its_application_in_finding_minimum_spanning_tree"><img alt="Research paper thumbnail of Improved similarity measure in neutrosophic environment and its application in finding minimum spanning tree" class="work-thumbnail" src="https://attachments.academia-assets.com/95235247/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148456/Improved_similarity_measure_in_neutrosophic_environment_and_its_application_in_finding_minimum_spanning_tree">Improved similarity measure in neutrosophic environment and its application in finding minimum spanning tree</a></div><div class="wp-workCard_item"><span>Journal of Intelligent &amp; Fuzzy Systems</span><span>, 2016</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Minimum spanning tree finds its huge application in network designing, approximation algorithms f...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Minimum spanning tree finds its huge application in network designing, approximation algorithms for NP-hard problems, clustering problems and many more. Many research works have been done to find minimum spanning tree due to its various applications. But, till date very few research works are available in finding minimum spanning tree in neutrosophic environment. This paper contributes significantly by defining the weight of each network edge using single valued neutrosophic set (SVNS) and introduce a new approach using similarity measure to find minimum spanning tree in neutrosophic environment. Use of SVNS makes the problem realistic as it can describe the uncertainty, indeterminacy and hesitancy of the real world in a better way. We introduce two new and simple similarity measures to overcome some disadvantages of existing Jaccard, Dice and Cosine similarity measures of SVNSs for ranking the alternatives. Further from the similarity measures we have developed two formulas for the entropy measure proving a fundamental relation between similarity measure and entropy measure. The new entropy measures define the uncertainty more explicitly in comparison to other entropy measure existing in the literature which has been established using an example.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="d30ccc3aead770795026f0b69ec8dd89" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235247,"asset_id":92148456,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235247/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148456"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148456"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148456; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148456]").text(description); $(".js-view-count[data-work-id=92148456]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148456; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148456']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "d30ccc3aead770795026f0b69ec8dd89" } } $('.js-work-strip[data-work-id=92148456]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148456,"title":"Improved similarity measure in neutrosophic environment and its application in finding minimum spanning tree","internal_url":"https://www.academia.edu/92148456/Improved_similarity_measure_in_neutrosophic_environment_and_its_application_in_finding_minimum_spanning_tree","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235247,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235247/thumbnails/1.jpg","file_name":"88146791c1daa2551f174162946eb291bde4.pdf","download_url":"https://www.academia.edu/attachments/95235247/download_file","bulk_download_file_name":"Improved_similarity_measure_in_neutrosop.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235247/88146791c1daa2551f174162946eb291bde4-libre.pdf?1670148654=\u0026response-content-disposition=attachment%3B+filename%3DImproved_similarity_measure_in_neutrosop.pdf\u0026Expires=1740004426\u0026Signature=LdGt4x5nq1AgIGlTLx~DGRUoMiFlWBF6GzYBrOv5b4K8HRWRTxqNk5CkWvZVoqtcl1Ca051iSDaZlEvSwtNMMKGhZcqN2K8qPp-vFb5Sf2Fbhs1drnXPzc484D-phL02Yav8zqJBpE9I6hwGvTZgpb-P62cNxLNfEyT0AgokA4L-~ogs06llzUO6MHpUtlKLbBQ1iC9g4w7d3RAox3lZR25A~GiMkf-h468-YL72C4MFPOyEGhX5YIFzTTUAjVRdHx3gH5oKx1lyADE8uSZKw-xuAS9TxIqe8JuAgSi~HcaHCOGA9vMc61tzaYPkSSRF~kOkrMwWJx9e~umOwmm90w__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148455"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148455/An_Approach_To_Propose_A_Model_For_E_Learning_Content_Up_Gradation_For_Increasing_Ger_Of_Higher_Education_In_West_Bengal"><img alt="Research paper thumbnail of An Approach To Propose A Model For E-Learning Content Up-Gradation For Increasing Ger Of Higher Education In West Bengal" class="work-thumbnail" src="https://attachments.academia-assets.com/95235265/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148455/An_Approach_To_Propose_A_Model_For_E_Learning_Content_Up_Gradation_For_Increasing_Ger_Of_Higher_Education_In_West_Bengal">An Approach To Propose A Model For E-Learning Content Up-Gradation For Increasing Ger Of Higher Education In West Bengal</a></div><div class="wp-workCard_item"><span>Procedia - Social and Behavioral Sciences</span><span>, 2011</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Quality of content in e-learning is undoubtedly the key aspect to attract the students aspiring t...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Quality of content in e-learning is undoubtedly the key aspect to attract the students aspiring to go for higher education through elearning. So, quality of e-learning content must be brief, precise, up to date and easily understandable so that it can be highly acceptable to the e-learning intended students. In this paper a model is anticipated with the objective to enhance the Gross Enrollment Ratio (GER) of West Bengal through establishment of e-learning in higher education. We provided an initial content of any subject matter and propose a scheme to upgrade the initially uploaded content up to a certain extent by using a graph theory based feedback method.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="3dbc7ad349e211e41264dd64f5041a7c" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235265,"asset_id":92148455,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235265/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148455"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148455"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148455; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148455]").text(description); $(".js-view-count[data-work-id=92148455]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148455; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148455']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "3dbc7ad349e211e41264dd64f5041a7c" } } $('.js-work-strip[data-work-id=92148455]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148455,"title":"An Approach To Propose A Model For E-Learning Content Up-Gradation For Increasing Ger Of Higher Education In West Bengal","internal_url":"https://www.academia.edu/92148455/An_Approach_To_Propose_A_Model_For_E_Learning_Content_Up_Gradation_For_Increasing_Ger_Of_Higher_Education_In_West_Bengal","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235265,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235265/thumbnails/1.jpg","file_name":"aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMTg3NzA0MjgxMTAyNTAyeA__.pdf","download_url":"https://www.academia.edu/attachments/95235265/download_file","bulk_download_file_name":"An_Approach_To_Propose_A_Model_For_E_Lea.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235265/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMTg3NzA0MjgxMTAyNTAyeA__-libre.pdf?1670148658=\u0026response-content-disposition=attachment%3B+filename%3DAn_Approach_To_Propose_A_Model_For_E_Lea.pdf\u0026Expires=1740004426\u0026Signature=E2MYQ2AmgRPQrcl7OMyPb9gvMR8X~-Ej8xkVj-HtrpnKLmo8AlWdHAh3kljc1CvRNg4FiMObfEx0wWYn~KEf8EuwLqPJApMoxBiEqsR8wSjg2YbmM9XV3z3m-RkEi~GUjHBdVuz-XfF4zuAND6TWnNMqri-BoYKdssAthewUZK2uYMDpp-n5N~qMAE-T0ntJSmGCzqEQwHYe4dN18fQZreXb7~6wB66cjdwv5jJCAOo4ltIyzpr5nEm3-0xEPSXbml9gnM8N25rhA03uxhmd9vfysgzFtd2AfHGgyD~QMLrCqSO2kHSBDZ8JTilhS2QX3WKcYv2NmyNKLrRqyeuExA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148454"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148454/A_study_to_increase_effectiveness_of_distance_learning_websites_in_India_with_special_reference_to_the_state_West_Bengal_to_increase_the_present_GER_of_higher_education_through_incorporation_of_Elearning_facility_in_a_better_way"><img alt="Research paper thumbnail of A study to increase effectiveness of distance learning websites in India with special reference to the state West Bengal to increase the present GER of higher education through incorporation of Elearning facility in a better way" class="work-thumbnail" src="https://attachments.academia-assets.com/95235245/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148454/A_study_to_increase_effectiveness_of_distance_learning_websites_in_India_with_special_reference_to_the_state_West_Bengal_to_increase_the_present_GER_of_higher_education_through_incorporation_of_Elearning_facility_in_a_better_way">A study to increase effectiveness of distance learning websites in India with special reference to the state West Bengal to increase the present GER of higher education through incorporation of Elearning facility in a better way</a></div><div class="wp-workCard_item"><span>Procedia - Social and Behavioral Sciences</span><span>, 2011</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">E-learning, the newly introduced concept has dramatically changed the previous style of learning ...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">E-learning, the newly introduced concept has dramatically changed the previous style of learning and made learning material within the reach of the common pupils aspiring higher education. Contextually, the websites of distance learning in India with special reference to the state West Bengal need to be radically ultra modernized in such a way so that learning materials will be available to the students and more pupils w0ill pay attention and interest to go for this web enabled learning which will gradually enhance the Gross Enrollment Ratio (GER) of West Bengal. In our study a comparative analysis has been made among the distance learning web pages or websites of internationally reputed universities and the distance learning web pages or websites of the universities of West Bengal. Moreover the present GER of advanced countries along with West Bengal are taken. The correlation between the effectiveness of websites and GER is analyzed and necessary suggestions with comments are recommended to increase the effectiveness of the university distance learning websites in West Bengal.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="281402b53d69fbd499c2c7936e5e0f91" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235245,"asset_id":92148454,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235245/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148454"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148454"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148454; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148454]").text(description); $(".js-view-count[data-work-id=92148454]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148454; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148454']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "281402b53d69fbd499c2c7936e5e0f91" } } $('.js-work-strip[data-work-id=92148454]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148454,"title":"A study to increase effectiveness of distance learning websites in India with special reference to the state West Bengal to increase the present GER of higher education through incorporation of Elearning facility in a better way","internal_url":"https://www.academia.edu/92148454/A_study_to_increase_effectiveness_of_distance_learning_websites_in_India_with_special_reference_to_the_state_West_Bengal_to_increase_the_present_GER_of_higher_education_through_incorporation_of_Elearning_facility_in_a_better_way","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235245,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235245/thumbnails/1.jpg","file_name":"81964384.pdf","download_url":"https://www.academia.edu/attachments/95235245/download_file","bulk_download_file_name":"A_study_to_increase_effectiveness_of_dis.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235245/81964384-libre.pdf?1670148659=\u0026response-content-disposition=attachment%3B+filename%3DA_study_to_increase_effectiveness_of_dis.pdf\u0026Expires=1740004426\u0026Signature=DphQBcYx6yrER1HrkXW8hKBh2pNHl6Pphp7SxL1~6ZsewThs6eMF7hcQ~8Kg5RmmaQTrTjsLWMpy2~hViAN2MvD9UCZuxl7Pbkn6MeAT6R4GBPZMWUmPlzkJWCr7LmLyMiXX5AfxqySLw3nNMxWLQEzzLXU0KFMw1BJlB5SlyesANUHnQuh06JCHeo3o6vU8fXJ0guFPv7CIoTOM1qCx22q2a0ap1xu0atAKSLYIR6m6NQ4sFs6kRffeV6Bw1vGYzRew2TwZky-caSnc1fkS6peBuy874J5V1r4IK0gFSNp1Lx7aJlCny2hrAiuiRs~OfsJv3k3dQuRvtzFSfzpfig__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> </div><div class="profile--tab_content_container js-tab-pane tab-pane" data-section-id="16561921" id="papers"><div class="js-work-strip profile--work_container" data-work-id="97900210"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/97900210/Multi_Criteria_Decision_Making_Method_In_Neutrosophic_Environment_Using_A_New_Aggregation_Operator_Score_And_Certainty_Function"><img alt="Research paper thumbnail of Multi Criteria Decision Making Method In Neutrosophic Environment Using A New Aggregation Operator, Score And Certainty Function" class="work-thumbnail" src="https://attachments.academia-assets.com/99397927/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/97900210/Multi_Criteria_Decision_Making_Method_In_Neutrosophic_Environment_Using_A_New_Aggregation_Operator_Score_And_Certainty_Function">Multi Criteria Decision Making Method In Neutrosophic Environment Using A New Aggregation Operator, Score And Certainty Function</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Neutrosophic sets, being generalization of classic sets, fuzzy sets and intuitionistic fuzzy sets...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Neutrosophic sets, being generalization of classic sets, fuzzy sets and intuitionistic fuzzy sets, can simultaneously represent uncertain, imprecise, incomplete, and inconsistent information existing in the real world. Neutrosophic theory has been developed in twenty first century and not much of arithmetic has been developed for this set. To solve any problem using neutrosophic data, it is desirable to have suitable operators, score function etc. Some operators like single valued neutrosophic weighted averaging (SVNWA) operator, single valued neutrosophic weighted geometric (SVNWG) operator are already defined in neutrosophic set (NS). In this paper an improved weighted average geometric (IWAG) operator which produces more meaningful results has been introduced to aggregate some real numbers and the same has been extended in neutrosophic environment.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="4e91fa2cfaf7f1c18cd93b609f1aaa95" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":99397927,"asset_id":97900210,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/99397927/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="97900210"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="97900210"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 97900210; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=97900210]").text(description); $(".js-view-count[data-work-id=97900210]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 97900210; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='97900210']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "4e91fa2cfaf7f1c18cd93b609f1aaa95" } } $('.js-work-strip[data-work-id=97900210]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":97900210,"title":"Multi Criteria Decision Making Method In Neutrosophic Environment Using A New Aggregation Operator, Score And Certainty Function","internal_url":"https://www.academia.edu/97900210/Multi_Criteria_Decision_Making_Method_In_Neutrosophic_Environment_Using_A_New_Aggregation_Operator_Score_And_Certainty_Function","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":99397927,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/99397927/thumbnails/1.jpg","file_name":"MultiCriteriaDecisionMakingMethod.pdf","download_url":"https://www.academia.edu/attachments/99397927/download_file","bulk_download_file_name":"Multi_Criteria_Decision_Making_Method_In.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/99397927/MultiCriteriaDecisionMakingMethod-libre.pdf?1677920705=\u0026response-content-disposition=attachment%3B+filename%3DMulti_Criteria_Decision_Making_Method_In.pdf\u0026Expires=1740004425\u0026Signature=WafYbIl~qqy6Dv7Vm1lY7au2MB-TosBPrMSwneJJDpJynFWTM48PDbnb5MPg55RGcPUhdgBg45OLRClnXfAekcSNcK7JLkRJEUICBHrxzDxkH376Z95JjJz4D8ECZ1u9kKVagzKVDc3LGHSA47h3OxgWdpKC9XSQSZ~YfN4Fq8F07v9Td47-xLjIJQ8hBcbbqI~sKbSUTGzpmWwKqdqnKfx9UlaxDjY-M8Gsd1D-30x7bhzt8RSUHyoyRNHd~JUROlSYGgN2gXf5uTSWrkIZmg3i4C8OBZGYDLk1wZ9hiO9r3QTmkVo4SVrSxI2egGWkTgFaMPySL6l-Y2ITxTHTJQ__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="97900209"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/97900209/Hypercomplex_Neutrosophic_Similarity_Measure_and_Its_Application_in_Multi_Criteria_Dicision_Making_Problem"><img alt="Research paper thumbnail of Hypercomplex Neutrosophic Similarity Measure & Its Application in Multi-Criteria Dicision Making Problem" class="work-thumbnail" src="https://attachments.academia-assets.com/99397913/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/97900209/Hypercomplex_Neutrosophic_Similarity_Measure_and_Its_Application_in_Multi_Criteria_Dicision_Making_Problem">Hypercomplex Neutrosophic Similarity Measure & Its Application in Multi-Criteria Dicision Making Problem</a></div><div class="wp-workCard_item"><span>viXra</span><span>, 2015</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Neutrosophic set is very useful to express uncertainty,impreciseness, incompleteness and inconsis...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Neutrosophic set is very useful to express uncertainty,impreciseness, incompleteness and inconsistency in a more general way.It is prevalent in real life application problems to express both indeterminate and inconsistent information.This paper focuses on introducing a new similarity measure in the neutrosophic environment.Similarity measure approach can be used in ranking the alternatives and determining the best among them.It is useful to find the optimum alternative for multicriteria decision making (MCDM) problems from similar alternatives in neutrosophic form.We define a function based on hypercomplex number system in this paper to determine the degree of similarity between single valued neutrosophic sets and thus a new approach to rank the alternatives in MCDM problems has been introduced.The approach of using hypercomplex number system in formulating the similarity measure in neutrosophic set is new and is not available in literature so far.Finally,a numerical example demonst...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="d542c46251caaa09ae6f4330577d1660" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":99397913,"asset_id":97900209,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/99397913/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="97900209"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="97900209"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 97900209; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=97900209]").text(description); $(".js-view-count[data-work-id=97900209]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 97900209; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='97900209']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "d542c46251caaa09ae6f4330577d1660" } } $('.js-work-strip[data-work-id=97900209]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":97900209,"title":"Hypercomplex Neutrosophic Similarity Measure \u0026 Its Application in Multi-Criteria Dicision Making Problem","internal_url":"https://www.academia.edu/97900209/Hypercomplex_Neutrosophic_Similarity_Measure_and_Its_Application_in_Multi_Criteria_Dicision_Making_Problem","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":99397913,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/99397913/thumbnails/1.jpg","file_name":"Hypercomplex_20Neutrosophic_20Similarity_20Measure.pdf","download_url":"https://www.academia.edu/attachments/99397913/download_file","bulk_download_file_name":"Hypercomplex_Neutrosophic_Similarity_Mea.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/99397913/Hypercomplex_20Neutrosophic_20Similarity_20Measure-libre.pdf?1677920713=\u0026response-content-disposition=attachment%3B+filename%3DHypercomplex_Neutrosophic_Similarity_Mea.pdf\u0026Expires=1740004425\u0026Signature=F48g-suJoR8C8edS49ughC3~inYPf94EL-6ok7frmd53HPUMEZKgpTc4u43IiPNZJmWSHiuOyGhchy~4WEKzmdnBQQ7YsBeiAFJKM2ygjnQAEbxuijt0gx4ujqvIfRsC2fc8SbedV-XSi6J5w4X1-6b1P6r1sLdoXXa4eK46JoCtviigh2tyAtLRwG9nKNujPnjfMLgNwOBBEEySe~SQ8GtJaox~Nx9SqnEg4o54WZHdZi7mT5N0V49hvFQ7lkUy52N1zJfhY0Kh5XFHv6txBZ3XVOkT4JXIzOn0Ry0X6~S9Rdhg2lwnGhzNeC1-hXk-KM5V9B1kDw8KoJ2aBFthDA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="97900207"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/97900207/Solution_of_Generalized_Fuzzy_Assignment_Problem_with_Restriction_on_Costs_under_Fuzzy_Environment"><img alt="Research paper thumbnail of Solution of Generalized Fuzzy Assignment Problem with Restriction on Costs under Fuzzy Environment" class="work-thumbnail" src="https://attachments.academia-assets.com/99397910/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/97900207/Solution_of_Generalized_Fuzzy_Assignment_Problem_with_Restriction_on_Costs_under_Fuzzy_Environment">Solution of Generalized Fuzzy Assignment Problem with Restriction on Costs under Fuzzy Environment</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">To solve the problems of Engineering and Management Science Generalized Assignment Problem (GAP) ...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">To solve the problems of Engineering and Management Science Generalized Assignment Problem (GAP) plays a very important role. The GAP is a classical example of a difficult combinatorial optimization problem that has received considerable attention over the years due to its widespread applications. In many instances it appears as a substructure in more complicated models, including routing problems, facility location models, knapsack problems, computer networking applications etc. Recently, Fuzzy Generalized Assignment Problem (FGAP) became very popular because in real life, data may not be known with certainty. So, to consider uncertainty in real life situations fuzzy data instead of crisp data is more advantageous. In this paper, cost for assigning the j-th job to the i-th person is taken as triangular fuzzy numbers. Further we have put a restriction on the total available cost which makes the problem more realistic and general. The problem is solved by modified Fuzzy Extremum Diff...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="76f6dd61735b4bb31c8a75add82ebf66" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":99397910,"asset_id":97900207,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/99397910/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="97900207"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="97900207"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 97900207; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=97900207]").text(description); $(".js-view-count[data-work-id=97900207]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 97900207; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='97900207']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "76f6dd61735b4bb31c8a75add82ebf66" } } $('.js-work-strip[data-work-id=97900207]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":97900207,"title":"Solution of Generalized Fuzzy Assignment Problem with Restriction on Costs under Fuzzy Environment","internal_url":"https://www.academia.edu/97900207/Solution_of_Generalized_Fuzzy_Assignment_Problem_with_Restriction_on_Costs_under_Fuzzy_Environment","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":99397910,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/99397910/thumbnails/1.jpg","file_name":"ijfmsv4n2_06.pdf","download_url":"https://www.academia.edu/attachments/99397910/download_file","bulk_download_file_name":"Solution_of_Generalized_Fuzzy_Assignment.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/99397910/ijfmsv4n2_06-libre.pdf?1677920718=\u0026response-content-disposition=attachment%3B+filename%3DSolution_of_Generalized_Fuzzy_Assignment.pdf\u0026Expires=1740004425\u0026Signature=D3qU-ykLBnU1w3GrkEmMvc8juhY3Py1WJlX9rcALMlnEm-h9~gbrRRTojKOciPwOUR3oOgJ95MnPH2gEXsIN8EOU8wvmf9fHEkR6MbKsV3j7wHycwoL3Q5wOaTr2knkzgEiO21TstL6~uYGOg-WJQk-DRE18wbF~Tbnvlp2j8ZiCUZIgS7Q4dG8Y2Oloi9r0Lb-ARnTJs0lr22k1T41vGdUDCdui6APLj74Pt6Q6IqLANkv48CcculWVofYyNyeVH1ykkHp6bBiQKj7teMBp0jnmB15pBR70~ZhbEIlWD1LtYgcp6BRz0DI5WfFa4FZd87ZS5eaGicFdSvCrz7Fkzg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"},{"id":99397909,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/99397909/thumbnails/1.jpg","file_name":"ijfmsv4n2_06.pdf","download_url":"https://www.academia.edu/attachments/99397909/download_file","bulk_download_file_name":"Solution_of_Generalized_Fuzzy_Assignment.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/99397909/ijfmsv4n2_06-libre.pdf?1677920718=\u0026response-content-disposition=attachment%3B+filename%3DSolution_of_Generalized_Fuzzy_Assignment.pdf\u0026Expires=1740004425\u0026Signature=P6wHMwvzmLGCKFQkO3uGbskr29Tir44DOYmzdZKeCHDSk9NPmO7E8LwRT7FrLu4PiwIgJTC42lcct3l8c8vRliQTGZmP4ovk42CLUN~cvKr7pPq7GNeb82ZgRZvVHRm6gT6EhFXCvtY72OMIZKdgpKc-XKk8gmMkH7pDG1pinGY2cPrb4FR4Iq8rwEKlmMn2Hk-bqeHXS1s0KzHD0dC1m6Lc3w0wE-zFw6f7KQgbdTO0u4ylz7dPsyiig5E0Kn5UuqW-dg17L5FwLZG0nNfWQTpXKcvFSNmrfLfMKwEIWE6x~RX7MmTqZ4tZNNbdfmIQJUVtA9xZcITgDKpDB-Tqdw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148470"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148470/Comparative_Study_of_Evolutionary_Algorithms_for_the_Optimum_Design_of_Thin_Broadband_Multilayer_Microwave_Absorber_for_Oblique_Incidence"><img alt="Research paper thumbnail of Comparative Study of Evolutionary Algorithms for the Optimum Design of Thin Broadband Multilayer Microwave Absorber for Oblique Incidence" class="work-thumbnail" src="https://attachments.academia-assets.com/95235259/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148470/Comparative_Study_of_Evolutionary_Algorithms_for_the_Optimum_Design_of_Thin_Broadband_Multilayer_Microwave_Absorber_for_Oblique_Incidence">Comparative Study of Evolutionary Algorithms for the Optimum Design of Thin Broadband Multilayer Microwave Absorber for Oblique Incidence</a></div><div class="wp-workCard_item"><span>International Journal of Microwave Engineering</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">With the increasing levels of Electromagnetic pollution almost exponentially in this modern age o...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">With the increasing levels of Electromagnetic pollution almost exponentially in this modern age of Electronics reported and highlighted by numerous studies carried out by scientists from all over the world, inspire engineers to concentrate their research for the optimum design of multilayer microwave absorber considering various parameters which are inherently conflicting in nature. In this paper we mainly focus on the comparative study of different Evolutionary algorithms for the optimum design of thin broadband (2-20GHz) multilayer microwave absorber for oblique incidence (30 0) considering arbitrary polarization of the electromagnetic waves. Different models are presented and synthesized using various Evolutionary algorithm namely Firefly algorithm (FA), Particle swarm optimization (PSO), Artificial bee colony optimization (ABC) and the best simulated results are tabulated and compared with each others.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="8a8e0f33122923f84c93f8656a692080" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235259,"asset_id":92148470,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235259/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148470"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148470"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148470; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148470]").text(description); $(".js-view-count[data-work-id=92148470]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148470; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148470']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "8a8e0f33122923f84c93f8656a692080" } } $('.js-work-strip[data-work-id=92148470]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148470,"title":"Comparative Study of Evolutionary Algorithms for the Optimum Design of Thin Broadband Multilayer Microwave Absorber for Oblique Incidence","internal_url":"https://www.academia.edu/92148470/Comparative_Study_of_Evolutionary_Algorithms_for_the_Optimum_Design_of_Thin_Broadband_Multilayer_Microwave_Absorber_for_Oblique_Incidence","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235259,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235259/thumbnails/1.jpg","file_name":"1116jmicro04.pdf","download_url":"https://www.academia.edu/attachments/95235259/download_file","bulk_download_file_name":"Comparative_Study_of_Evolutionary_Algori.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235259/1116jmicro04-libre.pdf?1670148661=\u0026response-content-disposition=attachment%3B+filename%3DComparative_Study_of_Evolutionary_Algori.pdf\u0026Expires=1740004425\u0026Signature=HIA5yPcY59d5dLYcUg9Bw-FdS8UUQQtjk8lQ12CnsLS6o-yPqWEzBajnU6oFOgfOvpHDFsxUSr2GId1gk7Qt3m6SErXW9IXbrnaMCahQHQHuj4Bne9M9FlT-iQeliTDX6mRsWbVl5CO9-YO-aY0GMTw~OckLwYbIJixABSys2va1vmsxv8A0J5hS8~ziDpFOQ~MtiVJAaq8naswQHRYoH66FDGs9WVAvBpbyzyjvsen7fPdr2dg8vLvUfv4a2v4IEGXA6qhlmtlNVIS8uhM~~Cs5lwIUFxZKOSaxs6QgLFg-jNo4J5Mdb-hDkzQjlnYCHQchGZgJPAwvw3Ju~u-sYg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148469"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148469/Application_Of_Extended_Fuzzy_Programming_Technique_To_A_Real_Life_Transportation_Problem_In_Neutrosophic_Environment"><img alt="Research paper thumbnail of Application Of Extended Fuzzy Programming Technique To A Real Life Transportation Problem In Neutrosophic Environment" class="work-thumbnail" src="https://attachments.academia-assets.com/95235257/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148469/Application_Of_Extended_Fuzzy_Programming_Technique_To_A_Real_Life_Transportation_Problem_In_Neutrosophic_Environment">Application Of Extended Fuzzy Programming Technique To A Real Life Transportation Problem In Neutrosophic Environment</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">This paper focuses on solving the transportation problems with neutrosophic data for the first ti...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">This paper focuses on solving the transportation problems with neutrosophic data for the first time. The indeterminacy factor has been considered in Transportation Problems (TP). The two methods of linear programming – Fuzzy Linear Programming (FLP) and Crisp Linear Programming (CLP) are discussed with reference to neutrosophic transportation problems. The first method uses the membership, non-membership and indeterminacy degrees separately to find the crisp solution using the Fuzzy Programming Technique and then the optimal solution is calculated in terms of neutrosophic data with the help of defined cost membership functions. The satisfaction degree is then calculated to check the better solution.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="728c73bfcd02c6c11cbccb0b22939939" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235257,"asset_id":92148469,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235257/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148469"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148469"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148469; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148469]").text(description); $(".js-view-count[data-work-id=92148469]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148469; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148469']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "728c73bfcd02c6c11cbccb0b22939939" } } $('.js-work-strip[data-work-id=92148469]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148469,"title":"Application Of Extended Fuzzy Programming Technique To A Real Life Transportation Problem In Neutrosophic Environment","internal_url":"https://www.academia.edu/92148469/Application_Of_Extended_Fuzzy_Programming_Technique_To_A_Real_Life_Transportation_Problem_In_Neutrosophic_Environment","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235257,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235257/thumbnails/1.jpg","file_name":"ApplicationOfExtendedFuzzyProgrammingTechnique.pdf","download_url":"https://www.academia.edu/attachments/95235257/download_file","bulk_download_file_name":"Application_Of_Extended_Fuzzy_Programmin.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235257/ApplicationOfExtendedFuzzyProgrammingTechnique-libre.pdf?1670148656=\u0026response-content-disposition=attachment%3B+filename%3DApplication_Of_Extended_Fuzzy_Programmin.pdf\u0026Expires=1740004425\u0026Signature=T4BLFe75UyrSLnXII2GozTUgBb9b7izeuEpJi3vlrcG1SCMPJtSDQGAqW-IBVTAYFJD-eTtm1l66R5x5Ivywxlv9LZELheb9BdfXU2Hjp3qC-lLTbU-zTI3uZRV5jL48XMml8opsjOWqE2laElYiLTpZhKjuQqjI8V6rjsTbW0j7tLM5v2feIVAmWvE7fuG5lGctrcH6t96TAeH4hmohbZre1gxzarKMerIH4pwAM9hFbi~IfUkUZ~zfn~HnzvXpnenFSxHzj4kb3-5J2j2weAukeotDgF6kjvlnsKsA550Ckbc2Sd7VBJivjZHU9R4uqw6bFJPFa3PQ6ZUaMeqyTw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148468"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148468/Solution_Of_Multi_Criteria_Assignment_Problem_Using_Neutrosophic_Set_Theory"><img alt="Research paper thumbnail of Solution Of Multi-Criteria Assignment Problem Using Neutrosophic Set Theory" class="work-thumbnail" src="https://attachments.academia-assets.com/95235256/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148468/Solution_Of_Multi_Criteria_Assignment_Problem_Using_Neutrosophic_Set_Theory">Solution Of Multi-Criteria Assignment Problem Using Neutrosophic Set Theory</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Assignment Problem (AP) is a very well-known and also useful decision making problem in real life...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Assignment Problem (AP) is a very well-known and also useful decision making problem in real life situations. It becomes more effective when different criteria are added. To solve Multi-Criteria Assignment Problem (MCAP), the different criteria have been considered as neutrosophic elements because Neutrosophic Set Theory (NST) is a generalization of the classical sets, conventional fuzzy sets, Intuitionistic Fuzzy Sets (IFS) and Interval Valued Fuzzy Sets (IVFS). In this paper two different methods have been proposed for solving MCAP.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="df7da37550326fa1336d5812af204fb8" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235256,"asset_id":92148468,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235256/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148468"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148468"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148468; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148468]").text(description); $(".js-view-count[data-work-id=92148468]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148468; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148468']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "df7da37550326fa1336d5812af204fb8" } } $('.js-work-strip[data-work-id=92148468]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148468,"title":"Solution Of Multi-Criteria Assignment Problem Using Neutrosophic Set Theory","internal_url":"https://www.academia.edu/92148468/Solution_Of_Multi_Criteria_Assignment_Problem_Using_Neutrosophic_Set_Theory","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235256,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235256/thumbnails/1.jpg","file_name":"SolutionOfMultiCriteriaAssignmentProblem.pdf","download_url":"https://www.academia.edu/attachments/95235256/download_file","bulk_download_file_name":"Solution_Of_Multi_Criteria_Assignment_Pr.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235256/SolutionOfMultiCriteriaAssignmentProblem-libre.pdf?1670148666=\u0026response-content-disposition=attachment%3B+filename%3DSolution_Of_Multi_Criteria_Assignment_Pr.pdf\u0026Expires=1740004425\u0026Signature=Mvzqj-5borR0M75wVxsEecChwzzJ9Q~LoJmtu3XZjOBik39c5d7JV0COp4ZEjXWQsqd3e8d2ttIgBMuKtpyf6Hpou7IXkYcfuCFNuBe9KaSw9fi2fc1rZuGCc48bJUKRmQCcRFaYd0ELGTA9u341CZn2zZgPTQB8IfGRGMcBXZRxvWebvwpg-5Vr9hwUp8Ais-fEs4QZbs4Lh9JxCOJ6PK2nFqPsCWWzfra6GBwA7BCGG5h9j8DjtXNHoVyWO2ZiANvodVaNFOJ4QsXJD6szDDQzSCv6RoiSIJJ9IPHcsSMcH-1yZ97qkCZSbOQ6LRn1oS~1GccYxNXb2nIbTf7euw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148467"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148467/Annals_of_Multiple_Fuzzy_Regression_Model_on_Two_Wheelers_Mileage_with_Several_independent_Factors"><img alt="Research paper thumbnail of Annals of Multiple Fuzzy Regression Model on Two Wheelers’ Mileage with Several independent Factors" class="work-thumbnail" src="https://attachments.academia-assets.com/95235254/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148467/Annals_of_Multiple_Fuzzy_Regression_Model_on_Two_Wheelers_Mileage_with_Several_independent_Factors">Annals of Multiple Fuzzy Regression Model on Two Wheelers’ Mileage with Several independent Factors</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Abstract. Regression is one of the important factors of statistical analysis. But the application...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Abstract. Regression is one of the important factors of statistical analysis. But the applications of statistical regression are bounded by the quantitative aspects. It is one of the major drawbacks of normal regression. Because real life applications are mostly based on uncertain interval estimation, than certain point estimation. Fuzzy logic is one of the best ways to deal with such problems. Here in this paper a fuzzy linear multiple regression analysis has been done on the mileage of two wheeler’s with several independent factors. In this multiple linear fuzzy regression model input data has been taken in two aspects, one is crisp another is triangular fuzzy data.Statistical level of significance is taken as membership values, ranges from 0 to 1. Defuzzification technique is used to generate the crisp mileage. In this entire work MATLAB, SPSS, MAPLE 6 are used for statistical calculation.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="f51b8121cba2fbb9c9a99744c4e22bed" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235254,"asset_id":92148467,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235254/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148467"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148467"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148467; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148467]").text(description); $(".js-view-count[data-work-id=92148467]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148467; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148467']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "f51b8121cba2fbb9c9a99744c4e22bed" } } $('.js-work-strip[data-work-id=92148467]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148467,"title":"Annals of Multiple Fuzzy Regression Model on Two Wheelers’ Mileage with Several independent Factors","internal_url":"https://www.academia.edu/92148467/Annals_of_Multiple_Fuzzy_Regression_Model_on_Two_Wheelers_Mileage_with_Several_independent_Factors","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235254,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235254/thumbnails/1.jpg","file_name":"apam-v5n1-11.pdf","download_url":"https://www.academia.edu/attachments/95235254/download_file","bulk_download_file_name":"Annals_of_Multiple_Fuzzy_Regression_Mode.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235254/apam-v5n1-11-libre.pdf?1670148662=\u0026response-content-disposition=attachment%3B+filename%3DAnnals_of_Multiple_Fuzzy_Regression_Mode.pdf\u0026Expires=1740004425\u0026Signature=TAbgICUENfiJHHno8pJ6XP7QDQ9THGw-XcywRzK9YhTZ9nOoTKY46OdHw4yMrJf~ScY5voJoDG7Vlazq9twDQpgkPbG0fNjLJ8I0nH1d9vpPwpwzp44J76nyaiv3aocLcHSM3xoHFEaqHfs1Ywj1-4iymP36sQGKa71GHXKP8rnlHF1EpTpiMlW2ozyGPr2QafLOcbHMqMG2B~zbdl0VOVZN2OZG2BwQbW1kredTbmGlFlRvfqaU-kGIukaEc8HjeEkMWrzqOC4nrkQHFJpV4ROCgT~qfrNH9rv3QcC9AM5rOTRR32EDgzHEML7eUNm2n241MSpxWKNFqT43vZvMIQ__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148466"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148466/Selection_of_Transportation_Companies_and_Their_Mode_of_Transportation_for_Interval_Valued_Data"><img alt="Research paper thumbnail of Selection of Transportation Companies and Their Mode of Transportation for Interval Valued Data" class="work-thumbnail" src="https://attachments.academia-assets.com/95235258/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148466/Selection_of_Transportation_Companies_and_Their_Mode_of_Transportation_for_Interval_Valued_Data">Selection of Transportation Companies and Their Mode of Transportation for Interval Valued Data</a></div><div class="wp-workCard_item"><span>viXra</span><span>, 2018</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The paper presents selection of transportation companies and their mode of transportation for int...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The paper presents selection of transportation companies and their mode of transportation for interval valued neutrosophic data. The paper focuses on the application of distance measures to select mode of transportation for transportation companies. The paper also presents the application of multi-criteria decision making method using weighted correlation coefficient and extended TOPSIS for transportation companies.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="1531a31debbcce61de5b1d975c509cd6" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235258,"asset_id":92148466,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235258/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148466"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148466"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148466; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148466]").text(description); $(".js-view-count[data-work-id=92148466]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148466; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148466']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "1531a31debbcce61de5b1d975c509cd6" } } $('.js-work-strip[data-work-id=92148466]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148466,"title":"Selection of Transportation Companies and Their Mode of Transportation for Interval Valued Data","internal_url":"https://www.academia.edu/92148466/Selection_of_Transportation_Companies_and_Their_Mode_of_Transportation_for_Interval_Valued_Data","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235258,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235258/thumbnails/1.jpg","file_name":"SelectionOfTransportation.pdf","download_url":"https://www.academia.edu/attachments/95235258/download_file","bulk_download_file_name":"Selection_of_Transportation_Companies_an.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235258/SelectionOfTransportation-libre.pdf?1670148673=\u0026response-content-disposition=attachment%3B+filename%3DSelection_of_Transportation_Companies_an.pdf\u0026Expires=1740004425\u0026Signature=T7~dkC6csAj3z9iOw~i~jcyKgtUDkYqsLs6xJcdzV3GW1PfxsTAiPRYt~QkbaFAgTy3K5r7vqUE5P0t-TJdgA7CPTEEvZ2gr97SO0VKB586Dv7oFzUVRiJs8~Rxzpu3j3lqO5H21W34Wz4DI0duVt0bUWkA2AO7SpqkBZvYgiYp9x1VWwjOCndsB-cwKcm0VI~WgTE5k5aJtAXRbUPcAk1Q3UeyWUIx6uIv50jTCzWe9wtKchbpNElL2djtvlPvyteIjrjQhbMLyA2V-PTFZrPQFfAQed6~0pbSxkU~gUJuKJg3HXn343r8s5XwiMkk46SiUCvj~CYjNhEz7uaut1Q__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148465"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148465/A_Study_to_Make_a_Clustering_of_Website_Attributes_on_User_Interface_to_Increase_the_Effectiveness_of_Indian_Educational_Websites"><img alt="Research paper thumbnail of A Study to Make a Clustering of Website Attributes on User Interface to Increase the Effectiveness of Indian Educational Websites" class="work-thumbnail" src="https://attachments.academia-assets.com/95235255/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148465/A_Study_to_Make_a_Clustering_of_Website_Attributes_on_User_Interface_to_Increase_the_Effectiveness_of_Indian_Educational_Websites">A Study to Make a Clustering of Website Attributes on User Interface to Increase the Effectiveness of Indian Educational Websites</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The effectiveness of distance learning websites has an impact on higher education of the particul...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The effectiveness of distance learning websites has an impact on higher education of the particular region. The socioeconomic structure of the people of a particular area has an impact on the enrollment as well as continuation of the study in higher education. The user feedback of students about different barriers to get enrolled in higher education has been taken. In this paper an attempt has been made to map the real problems with facilities that can be provided by educational websites. The possible ways to overcome these problems by increasing the effectiveness of educational websites by clustering the attributes of them have been presented in this study. In this study problem centric clusters of website attributes to increase the effectiveness of websites are made.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="91ea566def0e19d0d2386e1ad4ec2c56" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235255,"asset_id":92148465,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235255/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148465"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148465"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148465; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148465]").text(description); $(".js-view-count[data-work-id=92148465]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148465; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148465']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "91ea566def0e19d0d2386e1ad4ec2c56" } } $('.js-work-strip[data-work-id=92148465]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148465,"title":"A Study to Make a Clustering of Website Attributes on User Interface to Increase the Effectiveness of Indian Educational Websites","internal_url":"https://www.academia.edu/92148465/A_Study_to_Make_a_Clustering_of_Website_Attributes_on_User_Interface_to_Increase_the_Effectiveness_of_Indian_Educational_Websites","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235255,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235255/thumbnails/1.jpg","file_name":"7.pdf","download_url":"https://www.academia.edu/attachments/95235255/download_file","bulk_download_file_name":"A_Study_to_Make_a_Clustering_of_Website.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235255/7-libre.pdf?1670148653=\u0026response-content-disposition=attachment%3B+filename%3DA_Study_to_Make_a_Clustering_of_Website.pdf\u0026Expires=1740004426\u0026Signature=bJSm3M~muz598Nn3BL1ctNxBO9alk5bfXEU37jvpesjOwUae8TyB8szL72zy5ADMh~Rq~aZYbFriAzwEJpVpUlet8LiUrnONBX~TzrQa5pZSUbFcpwbHQYRK~--cAuJkO0l~3aozoXA78yRqkOnASNY-ZxuiUTZVLKxRzP6xExCJeEsmVYRV83yHB4ZyXjjDFYUcFCHQgMAXasWUq91z-VpLvnGTR3BU7AW-z6T~aGBgUYHVHDsrisqIw7TbZ-eFE9hyCWhJYVVsDFyeXJRKaDgTA7WjgnaWCklytiKnoVpdYKglejgnQTW~YkLBvebLCzcrTeZWh2zPGajrb63sAg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148464"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148464/A_Survey_on_E_Learning_Attributes_of_University_Websites_of_Different_Countries"><img alt="Research paper thumbnail of A Survey on E-Learning Attributes of University Websites of Different Countries" class="work-thumbnail" src="https://attachments.academia-assets.com/95235264/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148464/A_Survey_on_E_Learning_Attributes_of_University_Websites_of_Different_Countries">A Survey on E-Learning Attributes of University Websites of Different Countries</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">E-learning, has revolutionized the style of learning. Now learning material is available within t...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">E-learning, has revolutionized the style of learning. Now learning material is available within the reach of students who want to continue higher education. Besides this, distance learning system is getting popularity in different countries. Website can play a vital role in case of providing different on-line services to the students. The incorporation of several facilities in educational websites can remove different problems. So the effectiveness of educational websites needs to be increased when ever required. Mainly this incorporation is required in the countries where enrollment ratio in higher education is very low. LITERATURE REVIEW A research on the use of websites to make parents involved in education and whether it is effective or not is discussed by Yoon J in the year 2004 .A work on the development of effective educational website by integrating principle of active learning with the unique feature of the web was done by David A cook in the year 2004.A work on how educati...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="c0f7fe9c09943cbbae4a401af94d76d0" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235264,"asset_id":92148464,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235264/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148464"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148464"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148464; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148464]").text(description); $(".js-view-count[data-work-id=92148464]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148464; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148464']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "c0f7fe9c09943cbbae4a401af94d76d0" } } $('.js-work-strip[data-work-id=92148464]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148464,"title":"A Survey on E-Learning Attributes of University Websites of Different Countries","internal_url":"https://www.academia.edu/92148464/A_Survey_on_E_Learning_Attributes_of_University_Websites_of_Different_Countries","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235264,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235264/thumbnails/1.jpg","file_name":"3.pdf","download_url":"https://www.academia.edu/attachments/95235264/download_file","bulk_download_file_name":"A_Survey_on_E_Learning_Attributes_of_Uni.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235264/3-libre.pdf?1670148660=\u0026response-content-disposition=attachment%3B+filename%3DA_Survey_on_E_Learning_Attributes_of_Uni.pdf\u0026Expires=1740004426\u0026Signature=Y-W53lMrgYS4WE5N~APlCl8NIyMlv7Fra4RkhXwjzsVIxgxikLMpcCoQof3CJowO4bCwQQWlN3~Lxvch1WjV1gUVzf1Kj-c2Dq6ryDfM9yLPAOtBP43yNtiafa~1V0UKht7bg1rU-tP6iDocRcSJmhUIFcnxLC8Kzq4WkRKl99-QxLuC3yFeHiRsYUwHuU2nQlexbdgOEV~uDQ3tUG0jMRL8cdPIGBVgGDHouAu-G-E85PMYKGE0F~OR3B0XphqdXv53jTnLz3qveoDh07~hl9lCdRCZnQVKybYIyi6uOM4ugjrdS~n60ZbnzcL10U~83KdcKZ7dJBEMd6KgP81G9g__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148463"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/92148463/A_Prioritized_Decision_Making_Method_for_Reliability_Allocation_in_Optimistic_and_Pessimistic_View"><img alt="Research paper thumbnail of A Prioritized Decision Making Method for Reliability Allocation: in Optimistic and Pessimistic View" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/92148463/A_Prioritized_Decision_Making_Method_for_Reliability_Allocation_in_Optimistic_and_Pessimistic_View">A Prioritized Decision Making Method for Reliability Allocation: in Optimistic and Pessimistic View</a></div><div class="wp-workCard_item"><span>Journal of Integrated Design and Process Science</span><span>, 2021</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Reliability allocation is a very important problem during early design and development phases of ...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Reliability allocation is a very important problem during early design and development phases of a system. There are several reliability allocation techniques which are used to achieve the target reliability. The feasibility of objectives (FOO) technique is one of them that is widely used to perform system reliability allocation. But this technique has two fundamental shortcomings. The first is the measurement scale and the second is that it does not consider the order weight of the reliability allocation factors. The prioritization of the factors is also an important topic in decision making. Practically, all factors in multi-criteria decision making (MCDM) are not in the same priority level. Hence, in decision making situation, it is usual for decision makers to consider different priority factors. So, considering the prioritization of the factors, a reliability allocation method is proposed here to overcome the shortcomings of the FOO technique. Also, a case study on reliability ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148463"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148463"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148463; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148463]").text(description); $(".js-view-count[data-work-id=92148463]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148463; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148463']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=92148463]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148463,"title":"A Prioritized Decision Making Method for Reliability Allocation: in Optimistic and Pessimistic View","internal_url":"https://www.academia.edu/92148463/A_Prioritized_Decision_Making_Method_for_Reliability_Allocation_in_Optimistic_and_Pessimistic_View","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148462"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148462/Lattice_signatures_using_NTRU_on_the_hardness_of_worst_case_ideal_lattice_problems"><img alt="Research paper thumbnail of Lattice signatures using NTRU on the hardness of worst-case ideal lattice problems" class="work-thumbnail" src="https://attachments.academia-assets.com/95235253/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148462/Lattice_signatures_using_NTRU_on_the_hardness_of_worst_case_ideal_lattice_problems">Lattice signatures using NTRU on the hardness of worst-case ideal lattice problems</a></div><div class="wp-workCard_item"><span>IET Information Security</span><span>, 2020</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Recently, lattice signatures based on the Fiat-Shamir framework have seen a lot of improvements w...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Recently, lattice signatures based on the Fiat-Shamir framework have seen a lot of improvements which are efficient in practice. The security of these signature schemes depends mainly on the hardness of solving short integer solutions (SIS) and/or learning with errors problem in the random oracle model. The authors propose an alternative lattice-based signature scheme on the Fiat-Shamir framework over the ring ℤ[x]/(x n + 1). The key generation in the signature scheme is based on the combination of NTRU and Ring SIS like key generation. Both the signature and the verification are done efficiently by doing polynomial convolutions in the ring ℤ[x]/(x n + 1). The proposed signature scheme is provably secure based on the hardness of the Ring SIS problem in the random oracle model. The scheme is also efficient up to constant factors as the highly practical schemes which have provable secure instantiation.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="3605633d01dba11d6021632e42b1f56a" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235253,"asset_id":92148462,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235253/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148462"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148462"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148462; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148462]").text(description); $(".js-view-count[data-work-id=92148462]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148462; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148462']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "3605633d01dba11d6021632e42b1f56a" } } $('.js-work-strip[data-work-id=92148462]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148462,"title":"Lattice signatures using NTRU on the hardness of worst-case ideal lattice problems","internal_url":"https://www.academia.edu/92148462/Lattice_signatures_using_NTRU_on_the_hardness_of_worst_case_ideal_lattice_problems","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235253,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235253/thumbnails/1.jpg","file_name":"iet-ifs.2019.pdf","download_url":"https://www.academia.edu/attachments/95235253/download_file","bulk_download_file_name":"Lattice_signatures_using_NTRU_on_the_har.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235253/iet-ifs.2019-libre.pdf?1670148680=\u0026response-content-disposition=attachment%3B+filename%3DLattice_signatures_using_NTRU_on_the_har.pdf\u0026Expires=1740004426\u0026Signature=Ex8-CfU1sDUju3YikEogcTxn1TLqKcOIqBskj5hpWaFj90hGjtL4~BLSDiJm8R5MBiJ-DuZ03l2A8Xbw55UUPT1R24RhvZq6JxrdxiSkz2uYztKYO8nDztOSeW6~7uJbPoE2k-8Rq3PAkpeVy~Ujf1NIpM4KeY-ERhfbg9oRkzs0uTNmWC3kb4xqpLjzvnPSqRKjXxK5OP8khkE2lEvBfWvXfiMpbF~9VvzOV2eER01Sw5cG7C5-ddTdnru0AmnSGEyo6v31tLvgkL7loTm3tgw8KZzd9BeXwM5Tat7T3bqyPhrSzU0tqsYvoX~jPdxd~crW0IY-mGy1JYDyiO59fQ__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148461"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148461/An_attraction_based_particle_swarm_optimization_for_solving_multi_objective_availability_allocation_problem_under_uncertain_environment"><img alt="Research paper thumbnail of An attraction based particle swarm optimization for solving multi-objective availability allocation problem under uncertain environment" class="work-thumbnail" src="https://attachments.academia-assets.com/95235262/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148461/An_attraction_based_particle_swarm_optimization_for_solving_multi_objective_availability_allocation_problem_under_uncertain_environment">An attraction based particle swarm optimization for solving multi-objective availability allocation problem under uncertain environment</a></div><div class="wp-workCard_item"><span>Journal of Intelligent & Fuzzy Systems</span><span>, 2018</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Reliability optimization and availability optimization are two classes of optimization problems i...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Reliability optimization and availability optimization are two classes of optimization problems in redundancy allocation problem (RAP). Contrary to reliability optimization, very few researchers have focused on availability optimization to find out the optimal redundancy. This paper proposes a multi-objective optimization problem of availability allocation in a series-parallel system with repairable components. The two objectives are maximizing the system availability and minimizing the total cost of the system. In real life situation, due to complexity of the systems and non-linearity of their behaviour, most of the data are usually uncertain and imprecise. Hence in order to make the model more reliable, fuzzy theory has been introduced in terms of triangular data for handling the uncertainties. Thus in fuzzy environment a fuzzy multi-objective availability allocation problem is formulated. In order to solve the problem a crisp optimization problem has been reformulated using fuzzy programming technique and finally an attraction based particle swarm optimization (APSO) has been proposed to solve this crisp optimization problem. The proposed APSO is compared with the traditional Particle swarm optimization(PSO) to show the efficiency and consistency of the proposed approach. Based on a numerical example,the statistical analysis of the experimental results establish that the proposed APSO has a better and consistent performance compared to traditional PSO.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="bcd50182245034321667e563abf7a076" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235262,"asset_id":92148461,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235262/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148461"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148461"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148461; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148461]").text(description); $(".js-view-count[data-work-id=92148461]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148461; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148461']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "bcd50182245034321667e563abf7a076" } } $('.js-work-strip[data-work-id=92148461]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148461,"title":"An attraction based particle swarm optimization for solving multi-objective availability allocation problem under uncertain environment","internal_url":"https://www.academia.edu/92148461/An_attraction_based_particle_swarm_optimization_for_solving_multi_objective_availability_allocation_problem_under_uncertain_environment","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235262,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235262/thumbnails/1.jpg","file_name":"JIFS-1802920221204-1-13xg6te.pdf","download_url":"https://www.academia.edu/attachments/95235262/download_file","bulk_download_file_name":"An_attraction_based_particle_swarm_optim.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235262/JIFS-1802920221204-1-13xg6te-libre.pdf?1670148663=\u0026response-content-disposition=attachment%3B+filename%3DAn_attraction_based_particle_swarm_optim.pdf\u0026Expires=1740004426\u0026Signature=Za1BZAJpnVyMm6Uyr9Z5tIr6AbbVcfQ~ZPEt35CvwoLGrJHDg0Az5wNtM3J-jOG5UEmujflZmWVbriYIuOh9Ekt9QAXcpnYBuE-1vEZG6edsyXMxi9X1tpYZLgq-zQ32ylUxlXFUbkl610YuEo1bDBzFL2A1pJ8ZUbsBDxSIL7BLHogq182Ky37pd8l~yQr1iBM6GEQmBbqP4e3ktcnkkrnJbGS~H1igPEGoQkcwsceTDectUC7YkMqli4e-Hp~P5-1BFayV1Li3QJRcEqqrHjaea21EAbzBIJ8hr-0iGwl4Htyzb5bvXk2S-yhEwMWpeRbEuTMdeeDblFIrrL410A__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148460"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148460/Development_of_Estimation_Procedure_of_Population_Mean_in_Two_Phase_Stratified_Sampling"><img alt="Research paper thumbnail of Development of Estimation Procedure of Population Mean in Two-Phase Stratified Sampling" class="work-thumbnail" src="https://attachments.academia-assets.com/95235220/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148460/Development_of_Estimation_Procedure_of_Population_Mean_in_Two_Phase_Stratified_Sampling">Development of Estimation Procedure of Population Mean in Two-Phase Stratified Sampling</a></div><div class="wp-workCard_item"><span>Statistical Methodologies [Working Title]</span><span>, 2019</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">This article describes the problem of estimation of finite population mean in two-phase stratifie...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">This article describes the problem of estimation of finite population mean in two-phase stratified random sampling. Using information on two auxiliary variables, a class of product to regression chain type estimators has been proposed and its characteristic is discussed. The unbiased version of the proposed class of estimators has been constructed and the optimality condition for the proposed class of estimators is derived. The efficacy of the proposed methodology has been justified through empirical investigations carried over the data set of natural population as well as the data set of artificially generated population. The survey statistician may be suggested to use it.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="35b26b717122394fdd1880ad228fc304" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235220,"asset_id":92148460,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235220/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148460"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148460"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148460; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148460]").text(description); $(".js-view-count[data-work-id=92148460]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148460; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148460']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "35b26b717122394fdd1880ad228fc304" } } $('.js-work-strip[data-work-id=92148460]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148460,"title":"Development of Estimation Procedure of Population Mean in Two-Phase Stratified Sampling","internal_url":"https://www.academia.edu/92148460/Development_of_Estimation_Procedure_of_Population_Mean_in_Two_Phase_Stratified_Sampling","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235220,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235220/thumbnails/1.jpg","file_name":"65113.pdf","download_url":"https://www.academia.edu/attachments/95235220/download_file","bulk_download_file_name":"Development_of_Estimation_Procedure_of_P.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235220/65113-libre.pdf?1670148666=\u0026response-content-disposition=attachment%3B+filename%3DDevelopment_of_Estimation_Procedure_of_P.pdf\u0026Expires=1740004426\u0026Signature=UKC8IWyF5EmvqSWcSHNSHGIu705CV7SZse-3b5qHTG0yr41-UcQPDN0s-7XXm6XZ4fWOYA2CHOV7aeDXhMNZ1lmi2AAKSGc5uoIfJOkXwaW-EK8YpNhai43DeyoesaMkroFtO2ekdgE7z7mYADPtDDU~YQsQCTkSlCygwm23suRkCuF2nXsSmN70Lgn9c3niF1mCLBgK8M6CGpkMaZw9ay08dXmJC3Okrt4aKetpkV4J8WNp0yYU9VoXKm7Tt4p3KhJkxIIpCRobzo1JV1dMj8Nm9VKC608QhNpNsdp86hz-9iZHnEpuG4s0gD4LQFyW9kF6mH3Q2UEox9yp2mUw9Q__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"},{"id":95235219,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235219/thumbnails/1.jpg","file_name":"65113.pdf","download_url":"https://www.academia.edu/attachments/95235219/download_file","bulk_download_file_name":"Development_of_Estimation_Procedure_of_P.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235219/65113-libre.pdf?1670148665=\u0026response-content-disposition=attachment%3B+filename%3DDevelopment_of_Estimation_Procedure_of_P.pdf\u0026Expires=1740004426\u0026Signature=JlvuoirdyDJFs9lRYei1s~onLmUNoEQ8LhV1KyEmfHMlSNLfBv2kQz5L3rh8rgjHWCgoVUC2YXm0rRFTqfDkPVGdh4At~rfHrCx9fVQ-VXczX8ZfCObjSOPKqjTgh5HKU1OOtEn8o7DZL~yPcge8jx2qDinRH2vQsfrkzc69Nru~JqJ34HfSdskWjwXXLszbqTP4i4z0He584iBSX1nR5nixupFJhbVtMTf2CVTy6mxkZRjHJmDJuo4Ts4i041VYPyWTotXKjjTy3BONOlVwZ5ZO8N6GZFcfI4Snt2bjc4DH-hYcaMOLS4qoCJNPKdWLWBRtbasdbNx6xsOEJBlhog__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148459"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148459/Vector_aggregation_operator_and_score_function_to_solve_multi_criteria_decision_making_problem_in_neutrosophic_environment"><img alt="Research paper thumbnail of Vector aggregation operator and score function to solve multi-criteria decision making problem in neutrosophic environment" class="work-thumbnail" src="https://attachments.academia-assets.com/95235261/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148459/Vector_aggregation_operator_and_score_function_to_solve_multi_criteria_decision_making_problem_in_neutrosophic_environment">Vector aggregation operator and score function to solve multi-criteria decision making problem in neutrosophic environment</a></div><div class="wp-workCard_item"><span>International Journal of Machine Learning and Cybernetics</span><span>, 2018</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">In our real world there exist uncertain, imprecise, incomplete, and inconsistent information. Tho...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">In our real world there exist uncertain, imprecise, incomplete, and inconsistent information. Those kinds of information can be suitably handled by neutrosophic fuzzy set as it is the generalization of classic set, fuzzy set and intuitionistic fuzzy set. The uncertain, imprecise, incomplete and inconsistent information provided by several sources need to be aggregated to come to a conclusion. Aggregation and fusion of information are basic concerns for all kinds of knowledge based systems. The main purpose of this paper is to aggregate neutrosophic fuzzy information by introducing a new aggregation operator in vector approach. The new approach is simple based on basic vector operations and reliable as it will always give a meaningful result. Also a new vector score function has been defined to compare the neutrosophic fuzzy numbers and explained through geometrical interpretation. The newly proposed vector score function always gives different values for any two different neutrosophic numbers. Further, a multiple-criteria decision-making method is established on the basis of the proposed operator and newly defined score function.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="5956119997c1b14845d77d45e399e530" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235261,"asset_id":92148459,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235261/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148459"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148459"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148459; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148459]").text(description); $(".js-view-count[data-work-id=92148459]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148459; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148459']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "5956119997c1b14845d77d45e399e530" } } $('.js-work-strip[data-work-id=92148459]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148459,"title":"Vector aggregation operator and score function to solve multi-criteria decision making problem in neutrosophic environment","internal_url":"https://www.academia.edu/92148459/Vector_aggregation_operator_and_score_function_to_solve_multi_criteria_decision_making_problem_in_neutrosophic_environment","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235261,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235261/thumbnails/1.jpg","file_name":"s13042-018-0819-420221204-1-1btj25l.pdf","download_url":"https://www.academia.edu/attachments/95235261/download_file","bulk_download_file_name":"Vector_aggregation_operator_and_score_fu.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235261/s13042-018-0819-420221204-1-1btj25l-libre.pdf?1670148988=\u0026response-content-disposition=attachment%3B+filename%3DVector_aggregation_operator_and_score_fu.pdf\u0026Expires=1740004426\u0026Signature=LSTvbgHhfkJm2u5KmSQ44Gp6~uTkMCXOMcGr65emwp~~q0xl8uMnL0OgWxxobp01l61bmiRGmm49RYOShMLt8lIcYSjaQk4rKXA-IOE0zgVhxt2hCThs1DNZxvhlSXCfS-p1celY7tKGoXZ-tiow6KuGTo7m3t3eumZ39aiVIF3tK9LblF5N0mEkoT4JNuB4J5uQcqznREsttoj1BxTOOT~NHTtt4ikVjhCn4EGBwevk8ZTNqWsmoNpjck4d-KcUZkLtv18kaS0VvtrAaHkQzpkIWVOekhMQooJXHLSsJUO7flzks-uE1yl4~yJ3fCPYBvj5kvfK2b2icLDUYbVfDQ__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148458"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148458/Solution_of_a_class_of_generalized_assignment_problem"><img alt="Research paper thumbnail of Solution of a class of generalized assignment problem" class="work-thumbnail" src="https://attachments.academia-assets.com/95235263/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148458/Solution_of_a_class_of_generalized_assignment_problem">Solution of a class of generalized assignment problem</a></div><div class="wp-workCard_item"><span>Journal of Intelligent & Fuzzy Systems</span><span>, 2017</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The paper presents the solution of a multi objective multi-index generalized assignment problem u...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The paper presents the solution of a multi objective multi-index generalized assignment problem using Fuzzy Programming Technique which is a new concept. It emphasizes on minimization of the job cost and time at different sites where the jobs are being performed using different machines (medium). Multi objective assignment problem or multi objective generalized assignment problem have been solved in different ways by different mathematicians. But they have considered only two indices (jobs and alternatives). Here we have considered more than two indices and so it becomes a multi-index generalized assignment problem which makes it superior to the previous methods. This type of problem has not been solved earlier by our proposed method. Moreover in this paper Fuzzy Programming Technique has been used considering linear, exponential and hyperbolic (non-linear) membership functions for getting optimal solutions. Finally a real life application has been presented.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="76ad3219b82c18f120295ea27f8cd8a7" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235263,"asset_id":92148458,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235263/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148458"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148458"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148458; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148458]").text(description); $(".js-view-count[data-work-id=92148458]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148458; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148458']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "76ad3219b82c18f120295ea27f8cd8a7" } } $('.js-work-strip[data-work-id=92148458]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148458,"title":"Solution of a class of generalized assignment problem","internal_url":"https://www.academia.edu/92148458/Solution_of_a_class_of_generalized_assignment_problem","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235263,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235263/thumbnails/1.jpg","file_name":"JIFS-1708620221204-1-6gb8oa.pdf","download_url":"https://www.academia.edu/attachments/95235263/download_file","bulk_download_file_name":"Solution_of_a_class_of_generalized_assig.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235263/JIFS-1708620221204-1-6gb8oa-libre.pdf?1670148657=\u0026response-content-disposition=attachment%3B+filename%3DSolution_of_a_class_of_generalized_assig.pdf\u0026Expires=1740004426\u0026Signature=YvhAJ7dt1kn51VXvq2AZ2hv1ghWqH~ZTt6y2KT3vpNvUxOkBzZlwOg6lptwrBHmPOtLG9fY3md-No4WJD36DcjJ4cnY-Xui8FQeCiDyvh02vH3mMx~kSGKJC3J7cFK6QEHbOrTXsRXInk6ypR5FbV53cAsJcLbjiac-CUJLam29metGTNVqtxwBO0meVUEt9pO-ysXSqiHbmsRCD9xG83Mn37rxlIRjS4abmxfc-uypCJbLramFswm9w1awQHLseGEK3nq~VFpMDH2hkG0TDkmx08Buvjx1d0ThOGQGsFlx5WFbrNHAK1iaYJwsLcFq6Ux88aCh~bftMD39g7V~Gag__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148457"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148457/Solving_intuitionistic_fuzzy_transportation_problem_using_linear_programming"><img alt="Research paper thumbnail of Solving intuitionistic fuzzy transportation problem using linear programming" class="work-thumbnail" src="https://attachments.academia-assets.com/95235250/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148457/Solving_intuitionistic_fuzzy_transportation_problem_using_linear_programming">Solving intuitionistic fuzzy transportation problem using linear programming</a></div><div class="wp-workCard_item"><span>International Journal of System Assurance Engineering and Management</span><span>, 2017</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="ac3daf2e0fe1308ce6ac6e196b16fe46" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235250,"asset_id":92148457,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235250/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148457"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148457"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148457; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148457]").text(description); $(".js-view-count[data-work-id=92148457]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148457; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148457']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "ac3daf2e0fe1308ce6ac6e196b16fe46" } } $('.js-work-strip[data-work-id=92148457]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148457,"title":"Solving intuitionistic fuzzy transportation problem using linear programming","internal_url":"https://www.academia.edu/92148457/Solving_intuitionistic_fuzzy_transportation_problem_using_linear_programming","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235250,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235250/thumbnails/1.jpg","file_name":"s13198-017-0575-y20221204-1-1c62l49.pdf","download_url":"https://www.academia.edu/attachments/95235250/download_file","bulk_download_file_name":"Solving_intuitionistic_fuzzy_transportat.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235250/s13198-017-0575-y20221204-1-1c62l49-libre.pdf?1670148667=\u0026response-content-disposition=attachment%3B+filename%3DSolving_intuitionistic_fuzzy_transportat.pdf\u0026Expires=1740004426\u0026Signature=RZekFVsHdF~1F8qR32matdtwOflCwIqdgTXwwys-BLdHdIjFHXI7lj7IQq76-k3OFSfkpmSb2bBOmVFHsLz~JIWL5twHnY-~ni0eak3Y4yNz1ypgOcCQKAhq9O0rwd3vqsoh9pelxiTPSoK4M~-IhSHAMcvL~Bl~q3qYhsRii7mYv-nwofQcjcpZOG-uaiXWrWeHD6fMS~vk1X1wUBbOYNrZvTD6~wWwT5kAu-Y-wNAsHCSeG8oXFmIDt0tDhjKUWQ34gUVo72tVOvEnr1jbNEiVano0cA2sgCAw5eriNbOIKr7sOOgzaq3Nsvow61iJgjgGzT2TASRz4cA03OgCjg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148456"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148456/Improved_similarity_measure_in_neutrosophic_environment_and_its_application_in_finding_minimum_spanning_tree"><img alt="Research paper thumbnail of Improved similarity measure in neutrosophic environment and its application in finding minimum spanning tree" class="work-thumbnail" src="https://attachments.academia-assets.com/95235247/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148456/Improved_similarity_measure_in_neutrosophic_environment_and_its_application_in_finding_minimum_spanning_tree">Improved similarity measure in neutrosophic environment and its application in finding minimum spanning tree</a></div><div class="wp-workCard_item"><span>Journal of Intelligent &amp; Fuzzy Systems</span><span>, 2016</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Minimum spanning tree finds its huge application in network designing, approximation algorithms f...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Minimum spanning tree finds its huge application in network designing, approximation algorithms for NP-hard problems, clustering problems and many more. Many research works have been done to find minimum spanning tree due to its various applications. But, till date very few research works are available in finding minimum spanning tree in neutrosophic environment. This paper contributes significantly by defining the weight of each network edge using single valued neutrosophic set (SVNS) and introduce a new approach using similarity measure to find minimum spanning tree in neutrosophic environment. Use of SVNS makes the problem realistic as it can describe the uncertainty, indeterminacy and hesitancy of the real world in a better way. We introduce two new and simple similarity measures to overcome some disadvantages of existing Jaccard, Dice and Cosine similarity measures of SVNSs for ranking the alternatives. Further from the similarity measures we have developed two formulas for the entropy measure proving a fundamental relation between similarity measure and entropy measure. The new entropy measures define the uncertainty more explicitly in comparison to other entropy measure existing in the literature which has been established using an example.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="d30ccc3aead770795026f0b69ec8dd89" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235247,"asset_id":92148456,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235247/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148456"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148456"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148456; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148456]").text(description); $(".js-view-count[data-work-id=92148456]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148456; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148456']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "d30ccc3aead770795026f0b69ec8dd89" } } $('.js-work-strip[data-work-id=92148456]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148456,"title":"Improved similarity measure in neutrosophic environment and its application in finding minimum spanning tree","internal_url":"https://www.academia.edu/92148456/Improved_similarity_measure_in_neutrosophic_environment_and_its_application_in_finding_minimum_spanning_tree","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235247,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235247/thumbnails/1.jpg","file_name":"88146791c1daa2551f174162946eb291bde4.pdf","download_url":"https://www.academia.edu/attachments/95235247/download_file","bulk_download_file_name":"Improved_similarity_measure_in_neutrosop.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235247/88146791c1daa2551f174162946eb291bde4-libre.pdf?1670148654=\u0026response-content-disposition=attachment%3B+filename%3DImproved_similarity_measure_in_neutrosop.pdf\u0026Expires=1740004426\u0026Signature=LdGt4x5nq1AgIGlTLx~DGRUoMiFlWBF6GzYBrOv5b4K8HRWRTxqNk5CkWvZVoqtcl1Ca051iSDaZlEvSwtNMMKGhZcqN2K8qPp-vFb5Sf2Fbhs1drnXPzc484D-phL02Yav8zqJBpE9I6hwGvTZgpb-P62cNxLNfEyT0AgokA4L-~ogs06llzUO6MHpUtlKLbBQ1iC9g4w7d3RAox3lZR25A~GiMkf-h468-YL72C4MFPOyEGhX5YIFzTTUAjVRdHx3gH5oKx1lyADE8uSZKw-xuAS9TxIqe8JuAgSi~HcaHCOGA9vMc61tzaYPkSSRF~kOkrMwWJx9e~umOwmm90w__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148455"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148455/An_Approach_To_Propose_A_Model_For_E_Learning_Content_Up_Gradation_For_Increasing_Ger_Of_Higher_Education_In_West_Bengal"><img alt="Research paper thumbnail of An Approach To Propose A Model For E-Learning Content Up-Gradation For Increasing Ger Of Higher Education In West Bengal" class="work-thumbnail" src="https://attachments.academia-assets.com/95235265/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148455/An_Approach_To_Propose_A_Model_For_E_Learning_Content_Up_Gradation_For_Increasing_Ger_Of_Higher_Education_In_West_Bengal">An Approach To Propose A Model For E-Learning Content Up-Gradation For Increasing Ger Of Higher Education In West Bengal</a></div><div class="wp-workCard_item"><span>Procedia - Social and Behavioral Sciences</span><span>, 2011</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Quality of content in e-learning is undoubtedly the key aspect to attract the students aspiring t...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Quality of content in e-learning is undoubtedly the key aspect to attract the students aspiring to go for higher education through elearning. So, quality of e-learning content must be brief, precise, up to date and easily understandable so that it can be highly acceptable to the e-learning intended students. In this paper a model is anticipated with the objective to enhance the Gross Enrollment Ratio (GER) of West Bengal through establishment of e-learning in higher education. We provided an initial content of any subject matter and propose a scheme to upgrade the initially uploaded content up to a certain extent by using a graph theory based feedback method.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="3dbc7ad349e211e41264dd64f5041a7c" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235265,"asset_id":92148455,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235265/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148455"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148455"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148455; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148455]").text(description); $(".js-view-count[data-work-id=92148455]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148455; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148455']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "3dbc7ad349e211e41264dd64f5041a7c" } } $('.js-work-strip[data-work-id=92148455]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148455,"title":"An Approach To Propose A Model For E-Learning Content Up-Gradation For Increasing Ger Of Higher Education In West Bengal","internal_url":"https://www.academia.edu/92148455/An_Approach_To_Propose_A_Model_For_E_Learning_Content_Up_Gradation_For_Increasing_Ger_Of_Higher_Education_In_West_Bengal","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235265,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235265/thumbnails/1.jpg","file_name":"aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMTg3NzA0MjgxMTAyNTAyeA__.pdf","download_url":"https://www.academia.edu/attachments/95235265/download_file","bulk_download_file_name":"An_Approach_To_Propose_A_Model_For_E_Lea.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235265/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMTg3NzA0MjgxMTAyNTAyeA__-libre.pdf?1670148658=\u0026response-content-disposition=attachment%3B+filename%3DAn_Approach_To_Propose_A_Model_For_E_Lea.pdf\u0026Expires=1740004426\u0026Signature=E2MYQ2AmgRPQrcl7OMyPb9gvMR8X~-Ej8xkVj-HtrpnKLmo8AlWdHAh3kljc1CvRNg4FiMObfEx0wWYn~KEf8EuwLqPJApMoxBiEqsR8wSjg2YbmM9XV3z3m-RkEi~GUjHBdVuz-XfF4zuAND6TWnNMqri-BoYKdssAthewUZK2uYMDpp-n5N~qMAE-T0ntJSmGCzqEQwHYe4dN18fQZreXb7~6wB66cjdwv5jJCAOo4ltIyzpr5nEm3-0xEPSXbml9gnM8N25rhA03uxhmd9vfysgzFtd2AfHGgyD~QMLrCqSO2kHSBDZ8JTilhS2QX3WKcYv2NmyNKLrRqyeuExA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="92148454"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/92148454/A_study_to_increase_effectiveness_of_distance_learning_websites_in_India_with_special_reference_to_the_state_West_Bengal_to_increase_the_present_GER_of_higher_education_through_incorporation_of_Elearning_facility_in_a_better_way"><img alt="Research paper thumbnail of A study to increase effectiveness of distance learning websites in India with special reference to the state West Bengal to increase the present GER of higher education through incorporation of Elearning facility in a better way" class="work-thumbnail" src="https://attachments.academia-assets.com/95235245/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/92148454/A_study_to_increase_effectiveness_of_distance_learning_websites_in_India_with_special_reference_to_the_state_West_Bengal_to_increase_the_present_GER_of_higher_education_through_incorporation_of_Elearning_facility_in_a_better_way">A study to increase effectiveness of distance learning websites in India with special reference to the state West Bengal to increase the present GER of higher education through incorporation of Elearning facility in a better way</a></div><div class="wp-workCard_item"><span>Procedia - Social and Behavioral Sciences</span><span>, 2011</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">E-learning, the newly introduced concept has dramatically changed the previous style of learning ...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">E-learning, the newly introduced concept has dramatically changed the previous style of learning and made learning material within the reach of the common pupils aspiring higher education. Contextually, the websites of distance learning in India with special reference to the state West Bengal need to be radically ultra modernized in such a way so that learning materials will be available to the students and more pupils w0ill pay attention and interest to go for this web enabled learning which will gradually enhance the Gross Enrollment Ratio (GER) of West Bengal. In our study a comparative analysis has been made among the distance learning web pages or websites of internationally reputed universities and the distance learning web pages or websites of the universities of West Bengal. Moreover the present GER of advanced countries along with West Bengal are taken. The correlation between the effectiveness of websites and GER is analyzed and necessary suggestions with comments are recommended to increase the effectiveness of the university distance learning websites in West Bengal.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="281402b53d69fbd499c2c7936e5e0f91" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":95235245,"asset_id":92148454,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/95235245/download_file?s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="92148454"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="92148454"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 92148454; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=92148454]").text(description); $(".js-view-count[data-work-id=92148454]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 92148454; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='92148454']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "281402b53d69fbd499c2c7936e5e0f91" } } $('.js-work-strip[data-work-id=92148454]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":92148454,"title":"A study to increase effectiveness of distance learning websites in India with special reference to the state West Bengal to increase the present GER of higher education through incorporation of Elearning facility in a better way","internal_url":"https://www.academia.edu/92148454/A_study_to_increase_effectiveness_of_distance_learning_websites_in_India_with_special_reference_to_the_state_West_Bengal_to_increase_the_present_GER_of_higher_education_through_incorporation_of_Elearning_facility_in_a_better_way","owner_id":227760845,"coauthors_can_edit":true,"owner":{"id":227760845,"first_name":"Dr.Kajla","middle_initials":null,"last_name":"Basu","page_name":"DrKajlaBasu","domain_name":"independent","created_at":"2022-06-27T10:13:20.963-07:00","display_name":"Dr.Kajla Basu","url":"https://independent.academia.edu/DrKajlaBasu"},"attachments":[{"id":95235245,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/95235245/thumbnails/1.jpg","file_name":"81964384.pdf","download_url":"https://www.academia.edu/attachments/95235245/download_file","bulk_download_file_name":"A_study_to_increase_effectiveness_of_dis.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/95235245/81964384-libre.pdf?1670148659=\u0026response-content-disposition=attachment%3B+filename%3DA_study_to_increase_effectiveness_of_dis.pdf\u0026Expires=1740004426\u0026Signature=DphQBcYx6yrER1HrkXW8hKBh2pNHl6Pphp7SxL1~6ZsewThs6eMF7hcQ~8Kg5RmmaQTrTjsLWMpy2~hViAN2MvD9UCZuxl7Pbkn6MeAT6R4GBPZMWUmPlzkJWCr7LmLyMiXX5AfxqySLw3nNMxWLQEzzLXU0KFMw1BJlB5SlyesANUHnQuh06JCHeo3o6vU8fXJ0guFPv7CIoTOM1qCx22q2a0ap1xu0atAKSLYIR6m6NQ4sFs6kRffeV6Bw1vGYzRew2TwZky-caSnc1fkS6peBuy874J5V1r4IK0gFSNp1Lx7aJlCny2hrAiuiRs~OfsJv3k3dQuRvtzFSfzpfig__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> </div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js","https://a.academia-assets.com/assets/google_contacts-0dfb882d836b94dbcb4a2d123d6933fc9533eda5be911641f20b4eb428429600.js"], function() { // from javascript_helper.rb $('.js-google-connect-button').click(function(e) { e.preventDefault(); GoogleContacts.authorize_and_show_contacts(); Aedu.Dismissibles.recordClickthrough("WowProfileImportContactsPrompt"); }); $('.js-update-biography-button').click(function(e) { e.preventDefault(); Aedu.Dismissibles.recordClickthrough("UpdateUserBiographyPrompt"); $.ajax({ url: $r.api_v0_profiles_update_about_path({ subdomain_param: 'api', about: "", }), type: 'PUT', success: function(response) { location.reload(); } }); }); $('.js-work-creator-button').click(function (e) { e.preventDefault(); window.location = $r.upload_funnel_document_path({ source: encodeURIComponent(""), }); }); $('.js-video-upload-button').click(function (e) { e.preventDefault(); window.location = $r.upload_funnel_video_path({ source: encodeURIComponent(""), }); }); $('.js-do-this-later-button').click(function() { $(this).closest('.js-profile-nag-panel').remove(); Aedu.Dismissibles.recordDismissal("WowProfileImportContactsPrompt"); }); $('.js-update-biography-do-this-later-button').click(function(){ $(this).closest('.js-profile-nag-panel').remove(); Aedu.Dismissibles.recordDismissal("UpdateUserBiographyPrompt"); }); $('.wow-profile-mentions-upsell--close').click(function(){ $('.wow-profile-mentions-upsell--panel').hide(); Aedu.Dismissibles.recordDismissal("WowProfileMentionsUpsell"); }); $('.wow-profile-mentions-upsell--button').click(function(){ Aedu.Dismissibles.recordClickthrough("WowProfileMentionsUpsell"); }); new WowProfile.SocialRedesignUserWorks({ initialWorksOffset: 20, allWorksOffset: 20, maxSections: 1 }) }); </script> </div></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile_edit-5ea339ee107c863779f560dd7275595239fed73f1a13d279d2b599a28c0ecd33.js","https://a.academia-assets.com/assets/add_coauthor-22174b608f9cb871d03443cafa7feac496fb50d7df2d66a53f5ee3c04ba67f53.js","https://a.academia-assets.com/assets/tab-dcac0130902f0cc2d8cb403714dd47454f11fc6fb0e99ae6a0827b06613abc20.js","https://a.academia-assets.com/assets/wow_profile-a9bf3a2bc8c89fa2a77156577594264ee8a0f214d74241bc0fcd3f69f8d107ac.js"], function() { // from javascript_helper.rb window.ae = window.ae || {}; window.ae.WowProfile = window.ae.WowProfile || {}; if(Aedu.User.current && Aedu.User.current.id === $viewedUser.id) { window.ae.WowProfile.current_user_edit = {}; new WowProfileEdit.EditUploadView({ el: '.js-edit-upload-button-wrapper', model: window.$current_user, }); new AddCoauthor.AddCoauthorsController(); } var userInfoView = new WowProfile.SocialRedesignUserInfo({ recaptcha_key: "6LdxlRMTAAAAADnu_zyLhLg0YF9uACwz78shpjJB" }); WowProfile.router = new WowProfile.Router({ userInfoView: userInfoView }); Backbone.history.start({ pushState: true, root: "/" + $viewedUser.page_name }); new WowProfile.UserWorksNav() }); </script> </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; } .sign-in-with-apple-button > div { margin: 0 auto; / This centers the Apple-rendered button horizontally }</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: "e8e4f5f460ae6b99a8c8f2cf899ee81c38ae774cd82a52c0b2f3f785bcb3078b", });</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 type="hidden" name="authenticity_token" value="PaiYeVPgvsd48FBy42Q-M0Dtw_JOtddJMBch03CHsudxlswFeArXGwa05DwnGQM2s3p3i3qB0Z5ZmV4VtXwlOA" 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://independent.academia.edu/DrKajlaBasu" 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 type="hidden" name="authenticity_token" value="iTSCslmIR88sj_Ftr-x_24vj8s5LY6L_vlI97fdXyrLFCtbOcmIuE1LLRSNrkULeeHRGt39XpCjX3EIrMqxdbQ" 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 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/hc/en-us"><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 ©2025</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>