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>AR Publication - 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="8EZBOYho-e-XjnLEH07vAaegNwL7pxxETUn6-dY4keRd4GDjHYz-SKhPzKzQVGk0PMJuCZkXwfIGrtCSxqzvIg" /> <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="ar publication" /> <meta name="description" content="AR Publication: 569 Followers, 17 Research papers. Research interests: Computer Science, Engineering, and Computer Engineering." /> <meta name="google-site-verification" content="bKJMBZA7E43xhDOopFZkssMMkBRjvYERV-NaN4R6mrs" /> <script> var $controller_name = 'works'; var $action_name = "summary"; var $rails_env = 'production'; var $app_rev = '9bccae6c983d47cf1ce193ed94e1b2574fbaaeff'; 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":14023,"monthly_visitors":"102 million","monthly_visitor_count":102584291,"monthly_visitor_count_in_millions":102,"user_count":283376257,"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(1740158283000); window.Aedu.timeDifference = new Date().getTime() - 1740158283000; 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-1eb081e01ca8bc0c1b1d866df79d9eb4dd2c484e4beecf76e79a7806c72fee08.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-b42d48e01e9cb3bf5ae55ea154ab7133fe47240c1d7c59b0249065c67d6f65ab.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/core_webpack.wjs-bundle-f3fdf92d2e211a3fd7a717a75adb7bf4af30f5d7651964d9f223129f218112cd.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/ARMark" /> </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-fd736d66704990dee9f52cdbd5e7b1c7d1b031c0bb5a20dd676d1a6b7d5fea79.js" defer="defer"></script><script>$viewedUser = Aedu.User.set_viewed( {"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark","photo":"https://0.academia-photos.com/5624934/2451886/2850235/s65_ar.mark.jpg","has_photo":true,"is_analytics_public":true,"interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering"},{"id":1380,"name":"Computer Engineering","url":"https://www.academia.edu/Documents/in/Computer_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/ARMark","location":"/ARMark","scheme":"https","host":"independent.academia.edu","port":null,"pathname":"/ARMark","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-701f3779-79f7-42be-81a3-dc0d2282713d"></div> <div id="ProfileCheckPaperUpdate-react-component-701f3779-79f7-42be-81a3-dc0d2282713d"></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="AR Publication" 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/5624934/2451886/2850235/s200_ar.mark.jpg" /></div><div class="title-container"><h1 class="ds2-5-heading-sans-serif-sm">AR Publication</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="AR" data-follow-user-id="5624934" 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="5624934"><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">Followers</p><p class="data">569</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">0</p></div></a><div class="js-mentions-count-container" style="display: none;"><a href="/ARMark/mentions"><div class="stat-container"><p class="label">Mentions</p><p class="data"></p></div></a></div><a href="https://independent.academia.edu/ARMark/Analytics"><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></a></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://independent.academia.edu/MohammadEbadzadeh"><img class="profile-avatar u-positionAbsolute" alt="Mohammad Mehdi Ebadzadeh" 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/55424711/14646545/19836310/s200_mohammad_mehdi.ebadzadeh.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/MohammadEbadzadeh">Mohammad Mehdi Ebadzadeh</a></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://kntu.academia.edu/AliGhaffari"><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://kntu.academia.edu/AliGhaffari">Ali Ghaffari</a><p class="suggested-user-card__user-info__subheader ds2-5-body-xs">K.N.Toosi University of Technology</p></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://unina.academia.edu/CarloSansone"><img class="profile-avatar u-positionAbsolute" alt="Carlo Sansone" 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/37304234/10648266/11887068/s200_carlo.sansone.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://unina.academia.edu/CarloSansone">Carlo Sansone</a><p class="suggested-user-card__user-info__subheader ds2-5-body-xs">Universit脿 degli Studi di Napoli "Federico II"</p></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://independent.academia.edu/FelipeRamirez13"><img class="profile-avatar u-positionAbsolute" alt="Felipe Ramirez" 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/26141404/29462280/27419025/s200_felipe.ramirez.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/FelipeRamirez13">Felipe Ramirez</a></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://independent.academia.edu/ritujha3"><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/ritujha3">ritu jha</a></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://mmmut-in.academia.edu/mayankkumarGautam"><img class="profile-avatar u-positionAbsolute" alt="Mayank Kumar Gautam" 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/33624544/9917811/11057753/s200_mayank_kumar.gautam.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://mmmut-in.academia.edu/mayankkumarGautam">Mayank Kumar Gautam</a><p class="suggested-user-card__user-info__subheader ds2-5-body-xs">Madan Mohan Malaviya University of Technology, Gorakhpur</p></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://enis.academia.edu/kachouriabdennaceur"><img class="profile-avatar u-positionAbsolute" alt="kachouri abdennaceur" 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/2880073/1067413/1332467/s200_kachouri.abdennaceur.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://enis.academia.edu/kachouriabdennaceur">kachouri abdennaceur</a><p class="suggested-user-card__user-info__subheader ds2-5-body-xs">Ecole Nationale d'Ing茅nieurs de Sfax (ENIS)</p></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://ipm-institute.academia.edu/EliasEbrahimzadeh"><img class="profile-avatar u-positionAbsolute" alt="Elias Ebrahimzadeh" 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/5482047/2406127/17679725/s200_elias.ebrahimzadeh.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://ipm-institute.academia.edu/EliasEbrahimzadeh">Elias Ebrahimzadeh</a><p class="suggested-user-card__user-info__subheader ds2-5-body-xs">Institute for Research in Fundamental Sciences</p></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://coimbra.academia.edu/AntonioDourado"><img class="profile-avatar u-positionAbsolute" alt="Antonio Dourado" 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/3317538/1107715/14551358/s200_antonio.dourado.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://coimbra.academia.edu/AntonioDourado">Antonio Dourado</a><p class="suggested-user-card__user-info__subheader ds2-5-body-xs">Universidade de Coimbra</p></div></div><div class="suggested-user-card"><div class="suggested-user-card__avatar social-profile-avatar-container"><a href="https://independent.academia.edu/MohammadPooyan"><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/MohammadPooyan">Mohammad Pooyan</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="5624934" href="https://www.academia.edu/Documents/in/Computer_Science"><div id="js-react-on-rails-context" style="display:none" data-rails-context="{"inMailer":false,"i18nLocale":"en","i18nDefaultLocale":"en","href":"https://independent.academia.edu/ARMark","location":"/ARMark","scheme":"https","host":"independent.academia.edu","port":null,"pathname":"/ARMark","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":["Computer Science"]}" data-trace="false" data-dom-id="Pill-react-component-d854a1a4-e537-4473-b0b0-8f2a71a9ce86"></div> <div id="Pill-react-component-d854a1a4-e537-4473-b0b0-8f2a71a9ce86"></div> </a><a data-click-track="profile-user-info-expand-research-interests" data-has-card-for-ri-list="5624934" href="https://www.academia.edu/Documents/in/Engineering"><div class="js-react-on-rails-component" style="display:none" data-component-name="Pill" data-props="{"color":"gray","children":["Engineering"]}" data-trace="false" data-dom-id="Pill-react-component-58ff843a-0d12-4ebd-a0a5-399c035ab929"></div> <div id="Pill-react-component-58ff843a-0d12-4ebd-a0a5-399c035ab929"></div> </a><a data-click-track="profile-user-info-expand-research-interests" data-has-card-for-ri-list="5624934" href="https://www.academia.edu/Documents/in/Computer_Engineering"><div class="js-react-on-rails-component" style="display:none" data-component-name="Pill" data-props="{"color":"gray","children":["Computer Engineering"]}" data-trace="false" data-dom-id="Pill-react-component-902df00b-d6d1-4611-a0b3-a0469cf4e063"></div> <div id="Pill-react-component-902df00b-d6d1-4611-a0b3-a0469cf4e063"></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 AR Publication</h3></div><div class="js-work-strip profile--work_container" data-work-id="4805929"><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/4805929/Classification_of_Cardiac_Arrhythmias_Using_Heart_Rate_Variability_Signal"><img alt="Research paper thumbnail of Classification of Cardiac Arrhythmias Using Heart Rate Variability Signal" class="work-thumbnail" src="https://attachments.academia-assets.com/32103765/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/4805929/Classification_of_Cardiac_Arrhythmias_Using_Heart_Rate_Variability_Signal">Classification of Cardiac Arrhythmias Using Heart Rate Variability Signal</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The project aims at the determination of an effective arrhythmia classification algorithm using 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">The project aims at the determination of an effective arrhythmia classification algorithm using the Heart Rate Variability (HRV) signal. HRV signal is nothing but the RR interval in an ECG signal. The method is based on the Generalized Discriminant Analysis (GDA) feature reduction technique and the Multi Layer Perceptron (MLP) neural network classifier. At first, nine linear and nonlinear features are extracted from the HRV signals and then these features are reduced to only three by GDA. Finally, the MLP neural network is used to classify the HRV signals. The proposed Arrhythmia classification method is applied to input HRV signals, obtained from the MIT-BIH databases. Here, four types of the most life threatening cardiac arrhythmias including left bundle branch block, fist degree heart block, Supraventricular tachyarrhythmia and ventricular trigeminy can be discriminated by MLP and reduced features with the accuracy of 100%.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="67ce9ac485326a38ce06e0a5047b910a" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103765,"asset_id":4805929,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103765/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="4805929"><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="4805929"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805929; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805929]").text(description); $(".js-view-count[data-work-id=4805929]").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 = 4805929; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805929']"); 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: "67ce9ac485326a38ce06e0a5047b910a" } } $('.js-work-strip[data-work-id=4805929]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805929,"title":"Classification of Cardiac Arrhythmias Using Heart Rate Variability Signal","internal_url":"https://www.academia.edu/4805929/Classification_of_Cardiac_Arrhythmias_Using_Heart_Rate_Variability_Signal","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103765,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103765/thumbnails/1.jpg","file_name":"d113902.pdf","download_url":"https://www.academia.edu/attachments/32103765/download_file","bulk_download_file_name":"Classification_of_Cardiac_Arrhythmias_Us.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103765/d113902-libre.pdf?1391516900=\u0026response-content-disposition=attachment%3B+filename%3DClassification_of_Cardiac_Arrhythmias_Us.pdf\u0026Expires=1740161882\u0026Signature=Qd5jFyan6sGBB0aJpDHRBQM4Hqdds1gcZIWQtytfmeJAIf85-2PTY7xnzmKepuFlv9wVGgamIkGbOxhb0agocXXdj3fO5KQjKv-10zRFXUj20zIxOgs6uMWychtxppUDqjflA4~erds8EiPj-Dch5w2B~s49iWwx8yuJ82puqoNLK0aShNalmf-XKeNNUrHZ6W4xoM-qaLXCROWZ7VX5jlUNd~MjyiPDq0R8MHUbZoj-KGpEmTxBFbauZx6cCnrJMt~ER-UYA0uUhx0CKRo3ipgE32Hhd4BeK3O4ps24pGxpI12qM~eViJJ74nqaibmbvvzG6gecnH1xW3ATAqOxJg__\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="4805899"><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/4805899/Estimation_of_Skeletal_Maturity_by_Tanner_and_Whitehouse_Method"><img alt="Research paper thumbnail of Estimation of Skeletal Maturity by Tanner and Whitehouse Method" class="work-thumbnail" src="https://attachments.academia-assets.com/32103722/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/4805899/Estimation_of_Skeletal_Maturity_by_Tanner_and_Whitehouse_Method">Estimation of Skeletal Maturity by Tanner and Whitehouse Method</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The proposed paper present the development procedure for segmenting wrist bones commencing left h...</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 proposed paper present the development procedure for segmenting wrist bones commencing left hand wrist radiographs, which might exist more worn in estimating the skinny adulthood or bone age. Bone Age evaluation is a process used in the organization and analysis of endocrine disorders. It as well serves as a suggestion of the therapeutic consequence of behavior. It is of a great deal consequence in pediatric medicine in the finding of hormonal development or yet genetic disorders. The input radiographs are first preprocessed to remove noise using a Gaussian filter and then grayscale converted. Edge detection is done using canny edge detector. For Carpal Region of Interest analysis, bone removal is approved out by integrating anatomical information of the hand and trigonometric concepts; while a Tanner and Whitehouse method -phase task is achieved by combining the inclined vector flow Snakes and the imitative distinction of Gaussian filter. For Metaphyses Region of Interest study, image-processing methods and geometrical characteristic investigation, based on the dissimilarity of Gaussian, are proposed. The Region of Interest can be further used in feature extraction and classification to estimate the bone age. The Iterative Dichotomiser 3 classifier is used to classify the bones. The structure is validated by means of a statistics set of 50 images, 25 boys and 25 girls, and the results are discussed.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="9a213bda0ec20df4b8119b7e75f6c0de" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103722,"asset_id":4805899,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103722/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="4805899"><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="4805899"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805899; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805899]").text(description); $(".js-view-count[data-work-id=4805899]").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 = 4805899; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805899']"); 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: "9a213bda0ec20df4b8119b7e75f6c0de" } } $('.js-work-strip[data-work-id=4805899]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805899,"title":"Estimation of Skeletal Maturity by Tanner and Whitehouse Method","internal_url":"https://www.academia.edu/4805899/Estimation_of_Skeletal_Maturity_by_Tanner_and_Whitehouse_Method","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103722,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103722/thumbnails/1.jpg","file_name":"d113905.pdf","download_url":"https://www.academia.edu/attachments/32103722/download_file","bulk_download_file_name":"Estimation_of_Skeletal_Maturity_by_Tanne.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103722/d113905-libre.pdf?1391545309=\u0026response-content-disposition=attachment%3B+filename%3DEstimation_of_Skeletal_Maturity_by_Tanne.pdf\u0026Expires=1740161882\u0026Signature=Tpl28VZEKJcJv0tnEzIvJosGRu-l9RNEzxZ37rMc0Ssxyde~sMkqnYonbTrHaFotEfq0oiTmoOwyFmJFI1DglwbXxM3wOIvQrwR1rDzeWudUclK~MVr70tkZQMitOJ5Ch6gA0LYhJS-Xm8sZlXt3aHZpODfgcxhZlFLzBIud7FvQyn-~OJTzyTRvhGn00F-Ug4~tXO6G3QHKkmBcVF3qA3LmYXmamqJD3ZE~poxK7g75VtzeX2JSUhcokSHSMpqrc1MSiFuEPVCZtAtL~-ytRAPK~w86z4eIqzrclIZdUOlrrpPEpA~1j8ONDYbWG5~TyIoDUupsUrm4IyZMpw49~g__\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="4805898"><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/4805898/Comparison_of_Denoising_Algorithms_for_Microarray_Images"><img alt="Research paper thumbnail of Comparison of Denoising Algorithms for Microarray Images" class="work-thumbnail" src="https://attachments.academia-assets.com/32103724/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/4805898/Comparison_of_Denoising_Algorithms_for_Microarray_Images">Comparison of Denoising Algorithms for Microarray Images</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Microarray imaging is considered an important tool for large scale analysis of gene expression. 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">Microarray imaging is considered an important tool for large scale analysis of gene expression. The accuracy of the gene expression depends on the experiment itself and further image processing. It's well known that the noises introduced during the experiment will greatly affect the accuracy of the gene expression. How to eliminate the effect of the noise constitutes a challenging problem in microarray analysis. Traditionally, statistical methods are used to estimate the noises while the microarray images are being processed. A SWT approach is deal with the noise inherent in the microarray image processing procedure. That is, to denoise the image noises before further image processing using Stationary Wavelet Transform (SWT). The time invariant characteristic of SWT is particularly useful in image denoising. The testing result on sample microarray images has shown an enhanced image quality. The results also show that it has a better performance than conventional discrete wavelet transform and widely used adaptive Wiener filter.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="2b4070753b2c8d0d962ab7f4788ebb18" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103724,"asset_id":4805898,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103724/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="4805898"><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="4805898"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805898; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805898]").text(description); $(".js-view-count[data-work-id=4805898]").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 = 4805898; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805898']"); 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: "2b4070753b2c8d0d962ab7f4788ebb18" } } $('.js-work-strip[data-work-id=4805898]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805898,"title":"Comparison of Denoising Algorithms for Microarray Images","internal_url":"https://www.academia.edu/4805898/Comparison_of_Denoising_Algorithms_for_Microarray_Images","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103724,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103724/thumbnails/1.jpg","file_name":"d113904.pdf","download_url":"https://www.academia.edu/attachments/32103724/download_file","bulk_download_file_name":"Comparison_of_Denoising_Algorithms_for_M.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103724/d113904-libre.pdf?1391586463=\u0026response-content-disposition=attachment%3B+filename%3DComparison_of_Denoising_Algorithms_for_M.pdf\u0026Expires=1740161882\u0026Signature=GOjQm7WRJy0GZifiN~1GtyWt33aFYLDes~Ns-s1HyUV6PvmlqRRupGscz7p~F3KtPWFIPDpyTS4ZARE~Yj1ur~Q1V3j9mNrSVjp9L-KOTB1mRRnmj~KouEnZDj7kx07L2KGRZWBHJlnbSDZ-SRO1cBiprOwwE7xqagPPRwS9O2hj6hmzUFUKTiOfH6y7z1L-2OexH1HkndDr6bkNKEzXw7JJO0vb3NPG3T5Bwi9ti-PgmhzdeOEEnVjNthxucp4o~DUpp7Na1EbyzOQeTDUfmNtgOqluGS3WGlrd22lI3Z1TvEvNKNaLosylveZWkiflA6XzZFqOuSVkH8F3vGJF4w__\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="4805897"><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/4805897/A_Secured_Image_with_Pseudorandom_Permutation_Using_longer_bit_with_Chaotic_Maps"><img alt="Research paper thumbnail of A Secured Image with Pseudorandom Permutation Using longer bit with Chaotic Maps" class="work-thumbnail" src="https://attachments.academia-assets.com/32103721/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/4805897/A_Secured_Image_with_Pseudorandom_Permutation_Using_longer_bit_with_Chaotic_Maps">A Secured Image with Pseudorandom Permutation Using longer bit with Chaotic Maps</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Today's research on image in internet, security of images and videos became an important problem....</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">Today's research on image in internet, security of images and videos became an important problem. This manuscript designs an image encryption algorithm. We recommend a new image secured algorithm using a large pseudorandom permutation which is combinatorial generated from small permutation matrices based on chaotic maps. We are using longer pseudorandom bits for encryptions. The random-like nature of chaos is effectively spread into encrypted images by using the permutation matrix. This shows that the proposed encryption scheme provides comparable security with that of the conventional image encryption schemes based on Baker map or Logistic map.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="7962c30106aea2ff812e53df47e2bae0" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103721,"asset_id":4805897,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103721/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="4805897"><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="4805897"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805897; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805897]").text(description); $(".js-view-count[data-work-id=4805897]").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 = 4805897; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805897']"); 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: "7962c30106aea2ff812e53df47e2bae0" } } $('.js-work-strip[data-work-id=4805897]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805897,"title":"A Secured Image with Pseudorandom Permutation Using longer bit with Chaotic Maps","internal_url":"https://www.academia.edu/4805897/A_Secured_Image_with_Pseudorandom_Permutation_Using_longer_bit_with_Chaotic_Maps","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103721,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103721/thumbnails/1.jpg","file_name":"d113903.pdf","download_url":"https://www.academia.edu/attachments/32103721/download_file","bulk_download_file_name":"A_Secured_Image_with_Pseudorandom_Permut.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103721/d113903-libre.pdf?1391440708=\u0026response-content-disposition=attachment%3B+filename%3DA_Secured_Image_with_Pseudorandom_Permut.pdf\u0026Expires=1740161882\u0026Signature=ePSb9A~ROszPKbngyG6uoZHUr9uiyOe3THrB0ymFTd9BEroXbfs69XajgPhUF3vWoUx9nqI1wuRMQ5tvQE07-ZYQN-v2rxp2WiB3~b3ZdNUQ89ABu~r6hkk7Y6jG80uc2hny3IGToFEA5hMIlJXHB~DHNASRwxkt9e4epdqQRMBFW-uNkSEHRv1PEvzgMZg9iRxleEKkuDqbPgvgMwBtvWWJjREJ3abnDoQ-HMXW4pF7pC5rwaQQMvVLoGyfIkCelzSDPRireKtPkL~S50rXUIk1V0tdNXkl4FHmkOiT~HK-l6xZIeYFMz4FiRj2eGovy6LZez9yUBjgfLnFH7bSRQ__\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="4805896"><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/4805896/A_comparative_study_of_some_images_watermarking_algorithms"><img alt="Research paper thumbnail of A comparative study of some images watermarking algorithms" class="work-thumbnail" src="https://attachments.academia-assets.com/32103725/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/4805896/A_comparative_study_of_some_images_watermarking_algorithms">A comparative study of some images watermarking algorithms</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The advancement of transfer technology and sharing of digital data has made of the protection 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">The advancement of transfer technology and sharing of digital data has made of the protection of intellectual property a pressing need. The concept of digital watermarking was emerged as a solution to this problem. This new technology involves inserting a mark in the image (watermark), which characterizes the owner. The insertion can be done in a different manner depending on the length of the message to be inserted and the desired robustness. In this paper we will simulate some watermarking algorithms and their resistance during extraction of the mark, to two types of attacks (Gaussian noise, rotation 90 掳) , subjected to the watermarked image while providing the experimental results and the difference between each of these algorithms.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="67efe06e64dddbb798c72f12e6d9b174" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103725,"asset_id":4805896,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103725/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="4805896"><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="4805896"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805896; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805896]").text(description); $(".js-view-count[data-work-id=4805896]").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 = 4805896; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805896']"); 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: "67efe06e64dddbb798c72f12e6d9b174" } } $('.js-work-strip[data-work-id=4805896]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805896,"title":"A comparative study of some images watermarking algorithms","internal_url":"https://www.academia.edu/4805896/A_comparative_study_of_some_images_watermarking_algorithms","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103725,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103725/thumbnails/1.jpg","file_name":"d113901.pdf","download_url":"https://www.academia.edu/attachments/32103725/download_file","bulk_download_file_name":"A_comparative_study_of_some_images_water.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103725/d113901-libre.pdf?1391429556=\u0026response-content-disposition=attachment%3B+filename%3DA_comparative_study_of_some_images_water.pdf\u0026Expires=1740161882\u0026Signature=MdGGEGPqcONG05t13FfAwuXYLEqwL8VhYKvS~R-bNNFm9gseyHYuB2TArc1Hchtg5Hw-C1Rzy5RvcOpDcR3OVXluga~1J5fr0xkk3NyzxD4cx4W7MBsdUwAgijG0-eMYTniEXa-KHmJS8Rly1A1ZOwUGdT~AHYErDKt1pQ9MO8xjxKTD~1EWzO~ywDJrIYgd1SCxGWAPN1vy4Xh9nJQUgCr8FbWj8vae47reP74LMGlNUWGeSCogSokBzmu3B8eWWALPZMuvPtSVR2D9xKsxe9KIqw6MJ-BxTxbotVPjvFPd2M8fYQnIA-Pk2PWQgPbNOXzro-NgKSzXRvDT8MQwmw__\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="4805879"><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/4805879/Handwritten_Isolated_Digit_Recognition_Using_Artificial_Neural_Networks"><img alt="Research paper thumbnail of Handwritten Isolated Digit Recognition Using Artificial Neural Networks" class="work-thumbnail" src="https://attachments.academia-assets.com/32103711/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/4805879/Handwritten_Isolated_Digit_Recognition_Using_Artificial_Neural_Networks">Handwritten Isolated Digit Recognition Using Artificial Neural Networks</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">A new mechanism proposes the use of Artificial Neural Network (ANN) models for recognizing handwr...</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">A new mechanism proposes the use of Artificial Neural Network (ANN) models for recognizing handwritten isolated digits and also presents new techniques for to extract digits from scanned digits images. Remove the slope and slant from handwritten isolated digits and normalize the size of Digit images with our proposed methods. Experiments have been conducted on handwritten isolated digits and the achieved recognizing rates up to 99%.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="704b679a6b8b8775611ee253e23cd392" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103711,"asset_id":4805879,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103711/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="4805879"><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="4805879"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805879; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805879]").text(description); $(".js-view-count[data-work-id=4805879]").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 = 4805879; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805879']"); 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: "704b679a6b8b8775611ee253e23cd392" } } $('.js-work-strip[data-work-id=4805879]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805879,"title":"Handwritten Isolated Digit Recognition Using Artificial Neural Networks","internal_url":"https://www.academia.edu/4805879/Handwritten_Isolated_Digit_Recognition_Using_Artificial_Neural_Networks","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103711,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103711/thumbnails/1.jpg","file_name":"cs113905.pdf","download_url":"https://www.academia.edu/attachments/32103711/download_file","bulk_download_file_name":"Handwritten_Isolated_Digit_Recognition_U.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103711/cs113905-libre.pdf?1391469806=\u0026response-content-disposition=attachment%3B+filename%3DHandwritten_Isolated_Digit_Recognition_U.pdf\u0026Expires=1740161882\u0026Signature=UEN8bcr5Mc7VhHmbEnDu0muSSnCk65KcAjB65eE1tO410r3Dv7WeowHbIQJPfje-UQ0B76k3HSbjKA5m-nTXXwGL5vjU0rqyhraBFY4QgkeiXkaq9jEXpqAL7Wm4FLneIDWtWXMZydBYhWbePNF9QL2efr0c9~vM8Ly697xjZAYO7MPB3mEdXFqJ22GX0q5cT3P9hrbFlv6y-ZOpSa-1nwkJU5MNsoH7FROZGBBmWjVCWa~sjsfttzF-ERyhC9yYkUvjDGxPrZNMcX4VRFYfV2y7ricjfRtusd7OkmyJKEii8KHXADfRf1er2wQnuYqnI59vtzPPEn1vOoUJ58Xw-w__\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="4805878"><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/4805878/Quality_of_Service_Assurance_in_Mobile_Ad_Hoc_Networks"><img alt="Research paper thumbnail of Quality of Service Assurance in Mobile Ad-Hoc Networks" class="work-thumbnail" src="https://attachments.academia-assets.com/32103710/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/4805878/Quality_of_Service_Assurance_in_Mobile_Ad_Hoc_Networks">Quality of Service Assurance in Mobile Ad-Hoc Networks</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Mobile ad-hoc network (MANET) is a peer-to-peer wireless network. They are selfconfiguring, capab...</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">Mobile ad-hoc network (MANET) is a peer-to-peer wireless network. They are selfconfiguring, capable of self-directed operation and hastily deployable. In MANET nodes communicate with each other without the use of topology. Nodes are itinerant, topology can be very dynamic and nodes must be able to relay traffic because corresponding nodes might be out of range. The dynamic nature of MANET makes network open to attacks and unreliability. Routing is always the most noteworthy element for any networks. Node misbehaviour due to selfish or malicious intention could significantly degrade the performance of MANET. We focus on trust management framework, which is intended to cope with misbehaviour problem of node and increase the performance of MANETs. A trust-based system can be used to track this misbehaving of nodes, spot them and isolate them from routing and provide reliability. In this paper a Trust Based Reliable AODV [TBRAODV] protocol is presented which implements a trust value for each node. For every node trust value is calculated and based trust value nodes are allowed to participate in routing or else identified to become a misbehaving node. This augments reliability in AODV routing and results in increase of PDR, decrease in delay and maintains throughput. This work is implemented and simulated on NS-2.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="fef2c2421cbcc56d702239550e3a817a" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103710,"asset_id":4805878,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103710/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="4805878"><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="4805878"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805878; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805878]").text(description); $(".js-view-count[data-work-id=4805878]").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 = 4805878; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805878']"); 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: "fef2c2421cbcc56d702239550e3a817a" } } $('.js-work-strip[data-work-id=4805878]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805878,"title":"Quality of Service Assurance in Mobile Ad-Hoc Networks","internal_url":"https://www.academia.edu/4805878/Quality_of_Service_Assurance_in_Mobile_Ad_Hoc_Networks","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103710,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103710/thumbnails/1.jpg","file_name":"cs113904.pdf","download_url":"https://www.academia.edu/attachments/32103710/download_file","bulk_download_file_name":"Quality_of_Service_Assurance_in_Mobile_A.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103710/cs113904-libre.pdf?1391489130=\u0026response-content-disposition=attachment%3B+filename%3DQuality_of_Service_Assurance_in_Mobile_A.pdf\u0026Expires=1740161882\u0026Signature=Ib-tNjjrzpdwg5xTY6KJJapW-C2gS~Bs2jlHjkWF5T3YayW037SyAD7FZLNSWkJ90BEH130gcTCQ3GKYDgX4O3l2p6Afjbogpgtk9wWKBLlp~IFaWTRfk-r5i6KGmKUO2a2Qnn55-Sm0CQo4Bc6two-daZeoBfnbD2V3uyeGsjVVzVJYzqzc6mSa7~e~uYoDocLf5tWoPPI6KPU9nTrJI-E0ltOCrd3QiNM05a28ssLSparQ9q8fIHOA2MOcXg8T52yv9FkNqoTksZ078h5Atx-nVj99f8XVAXQAlPkaQQ~o0HjyxWlPSTwwI1cfBUB4LGUQdRnyUxTJftZxueKkdA__\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="4805850"><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/4805850/Deployment_of_Wireless_Sensor_Actuator_Network_System_to_Monitor_Off_shore_Deep_Sea_Oil_Well"><img alt="Research paper thumbnail of Deployment of Wireless Sensor Actuator Network System to Monitor Off-shore Deep Sea Oil Well" class="work-thumbnail" src="https://attachments.academia-assets.com/32103690/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/4805850/Deployment_of_Wireless_Sensor_Actuator_Network_System_to_Monitor_Off_shore_Deep_Sea_Oil_Well">Deployment of Wireless Sensor Actuator Network System to Monitor Off-shore Deep Sea Oil Well</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">In recent times, oil monitoring and exploration activities have gained importance considering the...</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 recent times, oil monitoring and exploration activities have gained importance considering the fact that in India alone, the oil import is 62 percent of the total imports. Thus seismic technology is being developed and used to get better estimate of the oil prospects.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="9e0853cc61b16a5b8ee0766f220c4779" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103690,"asset_id":4805850,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103690/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="4805850"><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="4805850"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805850; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805850]").text(description); $(".js-view-count[data-work-id=4805850]").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 = 4805850; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805850']"); 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: "9e0853cc61b16a5b8ee0766f220c4779" } } $('.js-work-strip[data-work-id=4805850]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805850,"title":"Deployment of Wireless Sensor Actuator Network System to Monitor Off-shore Deep Sea Oil Well","internal_url":"https://www.academia.edu/4805850/Deployment_of_Wireless_Sensor_Actuator_Network_System_to_Monitor_Off_shore_Deep_Sea_Oil_Well","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103690,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103690/thumbnails/1.jpg","file_name":"cs113903.pdf","download_url":"https://www.academia.edu/attachments/32103690/download_file","bulk_download_file_name":"Deployment_of_Wireless_Sensor_Actuator_N.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103690/cs113903-libre.pdf?1391546831=\u0026response-content-disposition=attachment%3B+filename%3DDeployment_of_Wireless_Sensor_Actuator_N.pdf\u0026Expires=1740161882\u0026Signature=EXhGL6gXHGiuW68HCli26DJu08RKlszN6L7qMpSXKhopAtFYi8UFuALFwo2SYF5lp3ISDzY8AHr3ploFx259owALgOJlfH~1AMvaTfjBIGYr6c0~aNh~EbPOhQOAwUjNzk2jQpXjCOFJKWz9yNQNHv~iRj~2Ko-mLIH6YuOySXOsZBW3QJgcxyyA1ovDZNuCmZWD2afvWZQUYX2ipYBGsKsATnBjOT8l3dmx1tY4Sm0-GClJCs~htoHdCyylDDzi-2LdQPyIxJ~nMMsr5fHKkz8PTBD7YrXObA3ze1F~4Fi9-uTnMwwLyuy6qPTkr4dF9~jKFsauyg78bG0y6npICQ__\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="4805839"><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/4805839/AN_ANALYSIS_OF_HEURISTIC_SEARCH_TECHNIQUES_IN_EVOLVING_AWALE_GAME_PLAYER"><img alt="Research paper thumbnail of AN ANALYSIS OF HEURISTIC SEARCH TECHNIQUES IN EVOLVING AWALE GAME PLAYER" class="work-thumbnail" src="https://attachments.academia-assets.com/32103687/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/4805839/AN_ANALYSIS_OF_HEURISTIC_SEARCH_TECHNIQUES_IN_EVOLVING_AWALE_GAME_PLAYER">AN ANALYSIS OF HEURISTIC SEARCH TECHNIQUES IN EVOLVING AWALE GAME PLAYER</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Game playing is an interesting aspect of computer systems and there are many algorithms being pro...</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">Game playing is an interesting aspect of computer systems and there are many algorithms being proposed and developed in this area. Evaluation of these techniques becomes a very crucial task in game playing. This paper studies the respective performance of various popular heuristic techniques against the Awale shareware and compares their results against each other.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="dff4485fcf492e06db705cb1c8a2959a" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103687,"asset_id":4805839,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103687/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="4805839"><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="4805839"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805839; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805839]").text(description); $(".js-view-count[data-work-id=4805839]").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 = 4805839; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805839']"); 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: "dff4485fcf492e06db705cb1c8a2959a" } } $('.js-work-strip[data-work-id=4805839]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805839,"title":"AN ANALYSIS OF HEURISTIC SEARCH TECHNIQUES IN EVOLVING AWALE GAME PLAYER","internal_url":"https://www.academia.edu/4805839/AN_ANALYSIS_OF_HEURISTIC_SEARCH_TECHNIQUES_IN_EVOLVING_AWALE_GAME_PLAYER","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103687,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103687/thumbnails/1.jpg","file_name":"cs113902.pdf","download_url":"https://www.academia.edu/attachments/32103687/download_file","bulk_download_file_name":"AN_ANALYSIS_OF_HEURISTIC_SEARCH_TECHNIQU.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103687/cs113902-libre.pdf?1391460313=\u0026response-content-disposition=attachment%3B+filename%3DAN_ANALYSIS_OF_HEURISTIC_SEARCH_TECHNIQU.pdf\u0026Expires=1740161882\u0026Signature=SoLRx5Rk3F17xTjJICmq5p6sfVzdDCHLajM3N1WGzjS~wiyl3erNzRbASlBC4UrwPfdv~lESQjUcSq5JuVJWTQqDhm8jiLUi66JDvnhk1boGPLylzpHabnkP5~HF7ysa8z7KnqcaJdFlPocHwoweF077PEx2w4aoKE-ImQK4qBk~tBXQLOd7mt2NkMN4gRxSvCcMcyGPT8InHhWdovtHZADhE6nMJgfpUdAHLyxvBMvWm9WVwXgfoDzMGdnqdm0Z3rL5BDLNRGcCIDiaS2ohff7--q1Ayk3Gfng-QEok7l9nLVmWSmLvXELpg6~exclWNka41zIOLXy4jtL3QcDfXQ__\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="4805836"><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/4805836/Impact_of_Malicious_Nodes_Concentration_on_MANET_performance"><img alt="Research paper thumbnail of Impact of Malicious Nodes Concentration on MANET performance" class="work-thumbnail" src="https://attachments.academia-assets.com/32103684/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/4805836/Impact_of_Malicious_Nodes_Concentration_on_MANET_performance">Impact of Malicious Nodes Concentration on MANET performance</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The communication in Mobile Ad hoc Networks (MANET) is multi-hop in nature i.e. each node relays ...</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 communication in Mobile Ad hoc Networks (MANET) is multi-hop in nature i.e. each node relays data packets of other nodes by spending its own resources such as battery power, processing speed and bandwidth etc. Ideally each node in MANET is supposed to perform this community service truthfully but in reality some nodes may try to disrupt the normal functioning of the network. The reasons for the same may be low residual battery power or rogue intention of a node. This paper is an effort to study the impact of malicious nodes concentration on MANET performance on three routing protocols i.e. AODV, DYMO and DSR by using QualNet as simulation tool. The results show that as the concentration of malicious nodes in the range of 30 to 40 % the impact on the performance metrics is maximum.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="cd40ed76e87db126b34046bd77e0f8ac" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103684,"asset_id":4805836,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103684/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="4805836"><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="4805836"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805836; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805836]").text(description); $(".js-view-count[data-work-id=4805836]").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 = 4805836; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805836']"); 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: "cd40ed76e87db126b34046bd77e0f8ac" } } $('.js-work-strip[data-work-id=4805836]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805836,"title":"Impact of Malicious Nodes Concentration on MANET performance","internal_url":"https://www.academia.edu/4805836/Impact_of_Malicious_Nodes_Concentration_on_MANET_performance","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103684,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103684/thumbnails/1.jpg","file_name":"cs113901.pdf","download_url":"https://www.academia.edu/attachments/32103684/download_file","bulk_download_file_name":"Impact_of_Malicious_Nodes_Concentration.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103684/cs113901-libre.pdf?1391108097=\u0026response-content-disposition=attachment%3B+filename%3DImpact_of_Malicious_Nodes_Concentration.pdf\u0026Expires=1740161882\u0026Signature=UkwRm~JJzN5GiOdBcXtlCutbvb2RF1w7SlF90w4bbPGGGun3FcHh1Q4iy3iyx2l4HDMW7o29uI7aimnMk-wCo5FAZrwjpe0IuB90GwmFUE04tpMtUJpTmmoGFAFSFmGTGfgNf3xnt7vVb4TW-m7tGioMqZOAPn0oobZ4bLPc6FvkHc03eGbEOV6FNJAl9tFckrqqVApcvTxgY56hJZ8XNcXwzds5qRDFR4WOTJD-GIXIPCRm75Nq48wDmW-X9UxQGjgqFIrd3Lsqa9UjS2CDfhXj5XT12CPEZuC-P6Q54wNrXW-w-biqrCM4wz3F-rlYzb6TfCesBJjChOxaBsl3Jg__\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="4805586"><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/4805586/Coverage_of_WCDMA_Network_Using_Different_Modulation_Techniques_with_Soft_and_Hard_Decision_Decoder"><img alt="Research paper thumbnail of Coverage of WCDMA Network Using Different Modulation Techniques with Soft and Hard Decision Decoder" class="work-thumbnail" src="https://attachments.academia-assets.com/32103559/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/4805586/Coverage_of_WCDMA_Network_Using_Different_Modulation_Techniques_with_Soft_and_Hard_Decision_Decoder">Coverage of WCDMA Network Using Different Modulation Techniques with Soft and Hard Decision Decoder</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The wideband code division multiple access (WCDMA) based 3G cellular mobile wireless networks are...</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 wideband code division multiple access (WCDMA) based 3G cellular mobile wireless networks are expected to provide a diverse range of multimedia services to mobile users with guaranteed quality of service (QoS). To serve diverse quality of service requirements of these networks it necessitates new radio resource management strategies for effective utilization of network resources with coding schemes. In this paper coverage area for voice traffic and with different modulation techniques, coding schemes and decision decoder are discussed. These discussions are to improve the coverage area in the mobile communication system. This paper is mainly focuses on coverage area of WCDMA system using link budget calculation with different modulation, coding schemes and decision decoder. Simulation results demonstrate coverage extension for voice service with different modulation,coding scheme, soft and hard decision decoder using appropriate Bit error rate (BER) to maintain QoS of the voice.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="c5c0cb1965d25137bf96ec5335545f80" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103559,"asset_id":4805586,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103559/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="4805586"><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="4805586"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805586; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805586]").text(description); $(".js-view-count[data-work-id=4805586]").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 = 4805586; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805586']"); 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: "c5c0cb1965d25137bf96ec5335545f80" } } $('.js-work-strip[data-work-id=4805586]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805586,"title":"Coverage of WCDMA Network Using Different Modulation Techniques with Soft and Hard Decision Decoder","internal_url":"https://www.academia.edu/4805586/Coverage_of_WCDMA_Network_Using_Different_Modulation_Techniques_with_Soft_and_Hard_Decision_Decoder","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103559,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103559/thumbnails/1.jpg","file_name":"113807.pdf","download_url":"https://www.academia.edu/attachments/32103559/download_file","bulk_download_file_name":"Coverage_of_WCDMA_Network_Using_Differen.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103559/113807-libre.pdf?1391533709=\u0026response-content-disposition=attachment%3B+filename%3DCoverage_of_WCDMA_Network_Using_Differen.pdf\u0026Expires=1740161882\u0026Signature=N25lhYBmu4ZGxzXDm0gU-Iwzgavt-OPfYU7yxnV5~o8ETvJWGUvPA-GXlybgT4baPat1i6NmxM2NxnS5dF3labELv3DFcbeV98Gc1e1WlPGgEbfr5v8mTmdwyXoO-AHN5fHb746XXk2EyOhWZr-2ecylH-lKd2gzJSmeQ3rVUZX4S7ABESnNBUqHUc92aj1GWhvfqEou70kBZNcDpQLWmz78rQMmll3X3Hp-VssWgqM2JcQz5O7PmD-u-axaXL1pDfkp0KKxE3WklquD5lTuce6fMlQxH8TDUqee0vMUfQVKSBMxkVlQstdrhGzc2BJXjVXWUYgB4N-0F~Y213NzcQ__\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="4805576"><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/4805576/The_Escalating_Nigeria_National_Security_Challenge_Smart_Objects_and_Internet_Of_Things_to_the_rescue"><img alt="Research paper thumbnail of The Escalating Nigeria National Security Challenge: Smart Objects and Internet-Of-Things to the rescue" class="work-thumbnail" src="https://attachments.academia-assets.com/32103550/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/4805576/The_Escalating_Nigeria_National_Security_Challenge_Smart_Objects_and_Internet_Of_Things_to_the_rescue">The Escalating Nigeria National Security Challenge: Smart Objects and Internet-Of-Things to the rescue</a></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="b5008d87f863fab2c1471b399427800b" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103550,"asset_id":4805576,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103550/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="4805576"><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="4805576"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805576; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805576]").text(description); $(".js-view-count[data-work-id=4805576]").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 = 4805576; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805576']"); 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: "b5008d87f863fab2c1471b399427800b" } } $('.js-work-strip[data-work-id=4805576]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805576,"title":"The Escalating Nigeria National Security Challenge: Smart Objects and Internet-Of-Things to the rescue","internal_url":"https://www.academia.edu/4805576/The_Escalating_Nigeria_National_Security_Challenge_Smart_Objects_and_Internet_Of_Things_to_the_rescue","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103550,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103550/thumbnails/1.jpg","file_name":"113806.pdf","download_url":"https://www.academia.edu/attachments/32103550/download_file","bulk_download_file_name":"The_Escalating_Nigeria_National_Security.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103550/113806-libre.pdf?1391519657=\u0026response-content-disposition=attachment%3B+filename%3DThe_Escalating_Nigeria_National_Security.pdf\u0026Expires=1740161882\u0026Signature=arP7Udr80IMsGXai03M8EMd-9zdkPApCXIZAqzCevopOb3ZLL-i332u7ZdqINg8D~LoDCt6lCJpAhl3XCyN0uYb86Y3t8Mwyce-a1DYd~8FlIRkL95CMwxA5RtZxW-ZpDIutNRSAWJe~Kj0F96TjmeFjxEz-oXZheLozcX~rCLiBum0F8jir-NtYe6PzXm2-~LrmvoVpL-8M9GoDMh85nWbiewE~BjjjzhM4KHj~r2xYcUpGl80BVRRHBXqi3LPFIy3hP3HBdMOurJwxooWje0RCdLmj58x~w8q7GVAaCdXb6fvXvh50duA9o1UGFOjnViDoJbRjCY1NtvGsifV9rg__\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="4805564"><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/4805564/Performance_Analysis_and_Simulation_of_OLSR_Routing_Protocol_in_MANET"><img alt="Research paper thumbnail of Performance Analysis and Simulation of OLSR Routing Protocol in MANET" class="work-thumbnail" src="https://attachments.academia-assets.com/32103535/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/4805564/Performance_Analysis_and_Simulation_of_OLSR_Routing_Protocol_in_MANET">Performance Analysis and Simulation of OLSR Routing Protocol in MANET</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Mobile ad hoc network is a collection of wireless nodes that are communicate other nodes (router)...</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">Mobile ad hoc network is a collection of wireless nodes that are communicate other nodes (router) without using access point, infrastructure . Mobile ad-hoc network is an autonomous system that means no need for depaentd other nodes it have own capability to handle and controlling all funcitionlity, to sending and receiving all information form one device to other device. MANET has power full feature that controlling itself by dynamic nature, multihop,low power and configuration of the system. In this paper we analyzing, simulation and implements the TC messages and HELLO Message by MPR of OLSR routing performance checked at 200 nodes on Qualnet 5.0.2 simulator. In Qualnet simulator to simulate and implement the performance of OLSR routing protocols takes various performance metrics like hello message sent (HMS) , hello message received (HMR), TC message generated (TCMG), TC message replied (TCMR), TC messages received on Constant Bit Rate (CBR) using random waypoint model. In this paper check the performance OLSR routing protocol gives effective performance for lage networks.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="fb253e317d81f4ce3a5ea1d8efd2c846" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103535,"asset_id":4805564,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103535/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="4805564"><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="4805564"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805564; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805564]").text(description); $(".js-view-count[data-work-id=4805564]").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 = 4805564; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805564']"); 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: "fb253e317d81f4ce3a5ea1d8efd2c846" } } $('.js-work-strip[data-work-id=4805564]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805564,"title":"Performance Analysis and Simulation of OLSR Routing Protocol in MANET","internal_url":"https://www.academia.edu/4805564/Performance_Analysis_and_Simulation_of_OLSR_Routing_Protocol_in_MANET","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103535,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103535/thumbnails/1.jpg","file_name":"113805.pdf","download_url":"https://www.academia.edu/attachments/32103535/download_file","bulk_download_file_name":"Performance_Analysis_and_Simulation_of_O.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103535/113805-libre.pdf?1391462624=\u0026response-content-disposition=attachment%3B+filename%3DPerformance_Analysis_and_Simulation_of_O.pdf\u0026Expires=1740161882\u0026Signature=YzhZy~c9bYyn5MUmqzH7Cu9SmdzjVLoIWk~q8c4ELQcYqHPr8lcjPdQ5V8k6K6c-xCvJnq62VMgP4SOLCyKLEdzxxOdZt6eX5kBs~vxXrpTCuEj9URdXMfC5qe7P2Ban9bNKz9AgV2829Fcl65t4briJcQGV8uJda0-Ca93V20uCMhL1~pD0MQ3bB~A-hgRXizX1AcqTzvJpAUz87nhUEJSCAy-daZeqVY~M2rq-dSDvacA7OccFce6C4XlgYrw1ueiO6wJDZ4E4GX1lbqJNm5lU47uFqBqi5oFoll2EftCZPf4VdBoGjYJIbwDmUULEkArbzF9dAy5CU~6LI2X4tQ__\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="4805558"><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/4805558/BookyScholia_A_Methodology_for_the_Investigation_of_Expert_Systems"><img alt="Research paper thumbnail of BookyScholia: A Methodology for the Investigation of Expert Systems" class="work-thumbnail" src="https://attachments.academia-assets.com/32103523/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/4805558/BookyScholia_A_Methodology_for_the_Investigation_of_Expert_Systems">BookyScholia: A Methodology for the Investigation of Expert Systems</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Mathematicians agree that encrypted modalities are an interesting new topic in the field of softw...</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">Mathematicians agree that encrypted modalities are an interesting new topic in the field of software engineering, and systems engineers concur. In our research, we proved the deployment of consistent hashing, which embodies the intuitive principles of algorithms. Our focus in our research is not on whether the World Wide Web and SMPs are largely incompatible, but rather on presenting an analysis of interrupts (BookyScholia). Experiences with such solution and active networks disconfirm that access points and cache coherence can synchronize to realize this mission. W woulde show that performance in BookyScholia is not an obstacle. The characteristics of BookyScholia, in relation to those of more seminal systems, are famously more natural. Finally,we would focus our efforts on validating that the UNIVAC computer can be made probabilistic, cooperative, and scalable.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="6831a6cd02c5ff0b5437097e838d327f" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103523,"asset_id":4805558,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103523/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="4805558"><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="4805558"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805558; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805558]").text(description); $(".js-view-count[data-work-id=4805558]").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 = 4805558; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805558']"); 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: "6831a6cd02c5ff0b5437097e838d327f" } } $('.js-work-strip[data-work-id=4805558]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805558,"title":"BookyScholia: A Methodology for the Investigation of Expert Systems","internal_url":"https://www.academia.edu/4805558/BookyScholia_A_Methodology_for_the_Investigation_of_Expert_Systems","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103523,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103523/thumbnails/1.jpg","file_name":"113804.pdf","download_url":"https://www.academia.edu/attachments/32103523/download_file","bulk_download_file_name":"BookyScholia_A_Methodology_for_the_Inves.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103523/113804-libre.pdf?1391497273=\u0026response-content-disposition=attachment%3B+filename%3DBookyScholia_A_Methodology_for_the_Inves.pdf\u0026Expires=1740161882\u0026Signature=GzJdZr4j8v-tp7aFSPrMWBAGr2SH7EeYHn2VI4k4WzlQ6oYFK9k6yTXhMt6W6OI-OfQ4kkyzL9gQKVOWepm-DTUoAUB4MmdHstHy7Gvz2kI1g7gmRVbA2uL6I7Rnl36u5C1EEuX-8yKvXoUIzYDOrumif70aTZbWKGjgR9gzIWWl4V32ks-eJXZQ808ngCqe~aIjMNRh3RlG0GcxQ-trIleXQj94BRFkVFDTDwIirZuzfCju6PH8w8iWqzzjg-ZjadBPK1zQrAtDG1Va23V~FXEHBWV3lD7CNvzOeGPTxSh7hWlVr6IsYnHSFJ~nhiXYsMIlf42iLDeb00-iZJKXBg__\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="4805544"><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/4805544/A_Joint_Encryption_Watermarking_Algorithm_for_Secure_Image_Transfer"><img alt="Research paper thumbnail of A Joint Encryption/Watermarking Algorithm for Secure Image Transfer" class="work-thumbnail" src="https://attachments.academia-assets.com/32103504/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/4805544/A_Joint_Encryption_Watermarking_Algorithm_for_Secure_Image_Transfer">A Joint Encryption/Watermarking Algorithm for Secure Image Transfer</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">This paper presents a method combining encryption and watermarking for secure images transfer. Th...</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 presents a method combining encryption and watermarking for secure images transfer. The proposed solution gives access to the outcomes of the image integrity and of its origins as its attachment to one user even if the image is stored encrypted. This method is based on the combination of encryption algorithms publicprivate keys and secret keys, and watermarking. The algorithm for image encryption uses a secret key. We encrypt the secret key with an asymmetric algorithm. This encrypted secret key is then inserted into the encrypted image using watermark algorithm.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="ec48b0fa7ab8eec7acfba78d947d1fb4" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103504,"asset_id":4805544,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103504/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="4805544"><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="4805544"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805544; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805544]").text(description); $(".js-view-count[data-work-id=4805544]").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 = 4805544; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805544']"); 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: "ec48b0fa7ab8eec7acfba78d947d1fb4" } } $('.js-work-strip[data-work-id=4805544]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805544,"title":"A Joint Encryption/Watermarking Algorithm for Secure Image Transfer","internal_url":"https://www.academia.edu/4805544/A_Joint_Encryption_Watermarking_Algorithm_for_Secure_Image_Transfer","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103504,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103504/thumbnails/1.jpg","file_name":"113803.pdf","download_url":"https://www.academia.edu/attachments/32103504/download_file","bulk_download_file_name":"A_Joint_Encryption_Watermarking_Algorith.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103504/113803-libre.pdf?1391479972=\u0026response-content-disposition=attachment%3B+filename%3DA_Joint_Encryption_Watermarking_Algorith.pdf\u0026Expires=1740161883\u0026Signature=OvFwmncYoNp57Ge0xz9bCYIrwrUU3iNtF5Q2BxV3v2KstL60PoW2UVEfuqS6LKsFU3HUOpZ2GFvlbqtOZaQKwr9EA1q6G63WZn2aCj0vy0PMI0xy096BVJs0hdNvcVwRlmde0hJNwyJZsEUtvye95jJthAH6Djnz6h~pv5hmdHlpzVGjPAKwGmxZ~zPrWiKe-~z9T3MBUE84U-JlpOfHJ4PaPx1o9UztBt7D1bVqzXIKasYSLRDVhcKstFaDb~I27rv7uMmNeCt~DcY2FA2nejo~TALjR-kGI0T6n~sueVz9BJks2fIcoCa2xXYq0qzRVZzaTsZRcxAJTI9GmXO-EQ__\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="4805513"><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/4805513/Performance_Comparison_of_Modified_Variable_Step_Size_Leaky_LMS_Algorithm_for_Channel_Estimation_in_Noisy_Environment"><img alt="Research paper thumbnail of Performance Comparison of Modified Variable Step Size Leaky LMS Algorithm for Channel Estimation in Noisy Environment" class="work-thumbnail" src="https://attachments.academia-assets.com/32103488/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/4805513/Performance_Comparison_of_Modified_Variable_Step_Size_Leaky_LMS_Algorithm_for_Channel_Estimation_in_Noisy_Environment">Performance Comparison of Modified Variable Step Size Leaky LMS Algorithm for Channel Estimation in Noisy Environment</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Rate for different signal to noise ratio, also compare the proposed scheme with standard LMS chan...</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">Rate for different signal to noise ratio, also compare the proposed scheme with standard LMS channel estimation method</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="6a31ff5697dcde4cb476f70dbbb5fddd" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103488,"asset_id":4805513,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103488/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="4805513"><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="4805513"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805513; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805513]").text(description); $(".js-view-count[data-work-id=4805513]").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 = 4805513; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805513']"); 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: "6a31ff5697dcde4cb476f70dbbb5fddd" } } $('.js-work-strip[data-work-id=4805513]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805513,"title":"Performance Comparison of Modified Variable Step Size Leaky LMS Algorithm for Channel Estimation in Noisy Environment","internal_url":"https://www.academia.edu/4805513/Performance_Comparison_of_Modified_Variable_Step_Size_Leaky_LMS_Algorithm_for_Channel_Estimation_in_Noisy_Environment","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103488,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103488/thumbnails/1.jpg","file_name":"113802.pdf","download_url":"https://www.academia.edu/attachments/32103488/download_file","bulk_download_file_name":"Performance_Comparison_of_Modified_Varia.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103488/113802-libre.pdf?1392422519=\u0026response-content-disposition=attachment%3B+filename%3DPerformance_Comparison_of_Modified_Varia.pdf\u0026Expires=1740161883\u0026Signature=eZtp8ia8UVYT65k-i-KhlCfQZc9FaQ5FMpAiC4QozInD3kODyEaGzlEU5ZLgJIsYOaq8fvOr-8ABsmLClshcrZlq5-zb68M8RvNBV33YjI28AWVfDJGUes6WxSBFHVCQNl4YVrkBJBT8yRZjWnMvmmoX5xAMSL~KOJ-7PaSCBiKQbeWTcjjZC2zF-aEEjOMZnjLiVKnlg-9pep0XI~raubiaaJEeIJ6uC3tzrM91LRs5cOnRJAw~xm7eNBm9StRqw0XFmUCA1B9cnrrs4UqRLIeVWP0TWYR7oZQ40xyWHOFV8I3UcIqKAe5ipRL9guZGCtEYTJPHANq4n2Xf8HAt7Q__\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="4805313"><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/4805313/Study_of_Polarization_Mode_Dispersion_in_the_Optical_Digital_Connection_to_High_Bit_Rate"><img alt="Research paper thumbnail of Study of Polarization Mode Dispersion in the Optical Digital Connection to High Bit Rate" class="work-thumbnail" src="https://attachments.academia-assets.com/32103351/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/4805313/Study_of_Polarization_Mode_Dispersion_in_the_Optical_Digital_Connection_to_High_Bit_Rate">Study of Polarization Mode Dispersion in the Optical Digital Connection to High Bit Rate</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Polarization Mode Dispersion (PMD) is a factor which limits the bit rate of the optical transmiss...</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">Polarization Mode Dispersion (PMD) is a factor which limits the bit rate of the optical transmissions. The PMD is such an effect which is time broadening due to the dependence of the group velocity to the signal polarization. The deformation effects of the impulses become considerable from 40 Gb/s. This paper, we reviews the degrade PMD effect in the telecommunications optical connections to high bit rate, due to the evolution of quality factor (Q) according to the fiber length, bit rate and PMD coefficient , well as the impact PMD on the degree of polarization and electrical power, we discuss also the representation of the polarization state and PMD vector on the Poincare sphere.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="a97788b6d3438e3f78b9dae303c191f0" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103351,"asset_id":4805313,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103351/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="4805313"><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="4805313"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805313; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805313]").text(description); $(".js-view-count[data-work-id=4805313]").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 = 4805313; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805313']"); 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: "a97788b6d3438e3f78b9dae303c191f0" } } $('.js-work-strip[data-work-id=4805313]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805313,"title":"Study of Polarization Mode Dispersion in the Optical Digital Connection to High Bit Rate","internal_url":"https://www.academia.edu/4805313/Study_of_Polarization_Mode_Dispersion_in_the_Optical_Digital_Connection_to_High_Bit_Rate","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103351,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103351/thumbnails/1.jpg","file_name":"113801.pdf","download_url":"https://www.academia.edu/attachments/32103351/download_file","bulk_download_file_name":"Study_of_Polarization_Mode_Dispersion_in.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103351/113801-libre.pdf?1391515653=\u0026response-content-disposition=attachment%3B+filename%3DStudy_of_Polarization_Mode_Dispersion_in.pdf\u0026Expires=1740161883\u0026Signature=I7CrBR-0QdxhA~QD4tXlWOILZqeByKsRKBVaXDWED1gQn59a~JBCXS0GV3A~hxKWzTzA-EXq9DTLvKbhQ~ZMPPYm4vhUlB0~sWEgxeGR8668NICbidhLi4ps7D7s9NjEBBOzkxosWBTjgj0hsKMJiwMc8I8y89kQD8JiWL5AAQGhMsgWG3u7raJnol8vDBIVRgKP6GtNiRUvOIkU4bUguOosh9lQhJQuvSHhGvWZJ4Y0mFCF26TgdXoPLynZZfi9foRhIpsSKxYwlNvSQ4w5wK-Bc0yd5wSohfk0YllduuXzYrUTuv~Y~Yt0tLFBXu6JchJeHOGn8O9LG61YXlJ2nA__\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="822575" id="papers"><div class="js-work-strip profile--work_container" data-work-id="4805929"><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/4805929/Classification_of_Cardiac_Arrhythmias_Using_Heart_Rate_Variability_Signal"><img alt="Research paper thumbnail of Classification of Cardiac Arrhythmias Using Heart Rate Variability Signal" class="work-thumbnail" src="https://attachments.academia-assets.com/32103765/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/4805929/Classification_of_Cardiac_Arrhythmias_Using_Heart_Rate_Variability_Signal">Classification of Cardiac Arrhythmias Using Heart Rate Variability Signal</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The project aims at the determination of an effective arrhythmia classification algorithm using 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">The project aims at the determination of an effective arrhythmia classification algorithm using the Heart Rate Variability (HRV) signal. HRV signal is nothing but the RR interval in an ECG signal. The method is based on the Generalized Discriminant Analysis (GDA) feature reduction technique and the Multi Layer Perceptron (MLP) neural network classifier. At first, nine linear and nonlinear features are extracted from the HRV signals and then these features are reduced to only three by GDA. Finally, the MLP neural network is used to classify the HRV signals. The proposed Arrhythmia classification method is applied to input HRV signals, obtained from the MIT-BIH databases. Here, four types of the most life threatening cardiac arrhythmias including left bundle branch block, fist degree heart block, Supraventricular tachyarrhythmia and ventricular trigeminy can be discriminated by MLP and reduced features with the accuracy of 100%.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="67ce9ac485326a38ce06e0a5047b910a" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103765,"asset_id":4805929,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103765/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="4805929"><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="4805929"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805929; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805929]").text(description); $(".js-view-count[data-work-id=4805929]").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 = 4805929; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805929']"); 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: "67ce9ac485326a38ce06e0a5047b910a" } } $('.js-work-strip[data-work-id=4805929]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805929,"title":"Classification of Cardiac Arrhythmias Using Heart Rate Variability Signal","internal_url":"https://www.academia.edu/4805929/Classification_of_Cardiac_Arrhythmias_Using_Heart_Rate_Variability_Signal","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103765,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103765/thumbnails/1.jpg","file_name":"d113902.pdf","download_url":"https://www.academia.edu/attachments/32103765/download_file","bulk_download_file_name":"Classification_of_Cardiac_Arrhythmias_Us.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103765/d113902-libre.pdf?1391516900=\u0026response-content-disposition=attachment%3B+filename%3DClassification_of_Cardiac_Arrhythmias_Us.pdf\u0026Expires=1740161882\u0026Signature=Qd5jFyan6sGBB0aJpDHRBQM4Hqdds1gcZIWQtytfmeJAIf85-2PTY7xnzmKepuFlv9wVGgamIkGbOxhb0agocXXdj3fO5KQjKv-10zRFXUj20zIxOgs6uMWychtxppUDqjflA4~erds8EiPj-Dch5w2B~s49iWwx8yuJ82puqoNLK0aShNalmf-XKeNNUrHZ6W4xoM-qaLXCROWZ7VX5jlUNd~MjyiPDq0R8MHUbZoj-KGpEmTxBFbauZx6cCnrJMt~ER-UYA0uUhx0CKRo3ipgE32Hhd4BeK3O4ps24pGxpI12qM~eViJJ74nqaibmbvvzG6gecnH1xW3ATAqOxJg__\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="4805899"><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/4805899/Estimation_of_Skeletal_Maturity_by_Tanner_and_Whitehouse_Method"><img alt="Research paper thumbnail of Estimation of Skeletal Maturity by Tanner and Whitehouse Method" class="work-thumbnail" src="https://attachments.academia-assets.com/32103722/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/4805899/Estimation_of_Skeletal_Maturity_by_Tanner_and_Whitehouse_Method">Estimation of Skeletal Maturity by Tanner and Whitehouse Method</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The proposed paper present the development procedure for segmenting wrist bones commencing left h...</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 proposed paper present the development procedure for segmenting wrist bones commencing left hand wrist radiographs, which might exist more worn in estimating the skinny adulthood or bone age. Bone Age evaluation is a process used in the organization and analysis of endocrine disorders. It as well serves as a suggestion of the therapeutic consequence of behavior. It is of a great deal consequence in pediatric medicine in the finding of hormonal development or yet genetic disorders. The input radiographs are first preprocessed to remove noise using a Gaussian filter and then grayscale converted. Edge detection is done using canny edge detector. For Carpal Region of Interest analysis, bone removal is approved out by integrating anatomical information of the hand and trigonometric concepts; while a Tanner and Whitehouse method -phase task is achieved by combining the inclined vector flow Snakes and the imitative distinction of Gaussian filter. For Metaphyses Region of Interest study, image-processing methods and geometrical characteristic investigation, based on the dissimilarity of Gaussian, are proposed. The Region of Interest can be further used in feature extraction and classification to estimate the bone age. The Iterative Dichotomiser 3 classifier is used to classify the bones. The structure is validated by means of a statistics set of 50 images, 25 boys and 25 girls, and the results are discussed.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="9a213bda0ec20df4b8119b7e75f6c0de" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103722,"asset_id":4805899,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103722/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="4805899"><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="4805899"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805899; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805899]").text(description); $(".js-view-count[data-work-id=4805899]").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 = 4805899; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805899']"); 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: "9a213bda0ec20df4b8119b7e75f6c0de" } } $('.js-work-strip[data-work-id=4805899]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805899,"title":"Estimation of Skeletal Maturity by Tanner and Whitehouse Method","internal_url":"https://www.academia.edu/4805899/Estimation_of_Skeletal_Maturity_by_Tanner_and_Whitehouse_Method","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103722,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103722/thumbnails/1.jpg","file_name":"d113905.pdf","download_url":"https://www.academia.edu/attachments/32103722/download_file","bulk_download_file_name":"Estimation_of_Skeletal_Maturity_by_Tanne.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103722/d113905-libre.pdf?1391545309=\u0026response-content-disposition=attachment%3B+filename%3DEstimation_of_Skeletal_Maturity_by_Tanne.pdf\u0026Expires=1740161882\u0026Signature=Tpl28VZEKJcJv0tnEzIvJosGRu-l9RNEzxZ37rMc0Ssxyde~sMkqnYonbTrHaFotEfq0oiTmoOwyFmJFI1DglwbXxM3wOIvQrwR1rDzeWudUclK~MVr70tkZQMitOJ5Ch6gA0LYhJS-Xm8sZlXt3aHZpODfgcxhZlFLzBIud7FvQyn-~OJTzyTRvhGn00F-Ug4~tXO6G3QHKkmBcVF3qA3LmYXmamqJD3ZE~poxK7g75VtzeX2JSUhcokSHSMpqrc1MSiFuEPVCZtAtL~-ytRAPK~w86z4eIqzrclIZdUOlrrpPEpA~1j8ONDYbWG5~TyIoDUupsUrm4IyZMpw49~g__\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="4805898"><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/4805898/Comparison_of_Denoising_Algorithms_for_Microarray_Images"><img alt="Research paper thumbnail of Comparison of Denoising Algorithms for Microarray Images" class="work-thumbnail" src="https://attachments.academia-assets.com/32103724/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/4805898/Comparison_of_Denoising_Algorithms_for_Microarray_Images">Comparison of Denoising Algorithms for Microarray Images</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Microarray imaging is considered an important tool for large scale analysis of gene expression. 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">Microarray imaging is considered an important tool for large scale analysis of gene expression. The accuracy of the gene expression depends on the experiment itself and further image processing. It's well known that the noises introduced during the experiment will greatly affect the accuracy of the gene expression. How to eliminate the effect of the noise constitutes a challenging problem in microarray analysis. Traditionally, statistical methods are used to estimate the noises while the microarray images are being processed. A SWT approach is deal with the noise inherent in the microarray image processing procedure. That is, to denoise the image noises before further image processing using Stationary Wavelet Transform (SWT). The time invariant characteristic of SWT is particularly useful in image denoising. The testing result on sample microarray images has shown an enhanced image quality. The results also show that it has a better performance than conventional discrete wavelet transform and widely used adaptive Wiener filter.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="2b4070753b2c8d0d962ab7f4788ebb18" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103724,"asset_id":4805898,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103724/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="4805898"><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="4805898"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805898; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805898]").text(description); $(".js-view-count[data-work-id=4805898]").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 = 4805898; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805898']"); 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: "2b4070753b2c8d0d962ab7f4788ebb18" } } $('.js-work-strip[data-work-id=4805898]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805898,"title":"Comparison of Denoising Algorithms for Microarray Images","internal_url":"https://www.academia.edu/4805898/Comparison_of_Denoising_Algorithms_for_Microarray_Images","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103724,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103724/thumbnails/1.jpg","file_name":"d113904.pdf","download_url":"https://www.academia.edu/attachments/32103724/download_file","bulk_download_file_name":"Comparison_of_Denoising_Algorithms_for_M.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103724/d113904-libre.pdf?1391586463=\u0026response-content-disposition=attachment%3B+filename%3DComparison_of_Denoising_Algorithms_for_M.pdf\u0026Expires=1740161882\u0026Signature=GOjQm7WRJy0GZifiN~1GtyWt33aFYLDes~Ns-s1HyUV6PvmlqRRupGscz7p~F3KtPWFIPDpyTS4ZARE~Yj1ur~Q1V3j9mNrSVjp9L-KOTB1mRRnmj~KouEnZDj7kx07L2KGRZWBHJlnbSDZ-SRO1cBiprOwwE7xqagPPRwS9O2hj6hmzUFUKTiOfH6y7z1L-2OexH1HkndDr6bkNKEzXw7JJO0vb3NPG3T5Bwi9ti-PgmhzdeOEEnVjNthxucp4o~DUpp7Na1EbyzOQeTDUfmNtgOqluGS3WGlrd22lI3Z1TvEvNKNaLosylveZWkiflA6XzZFqOuSVkH8F3vGJF4w__\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="4805897"><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/4805897/A_Secured_Image_with_Pseudorandom_Permutation_Using_longer_bit_with_Chaotic_Maps"><img alt="Research paper thumbnail of A Secured Image with Pseudorandom Permutation Using longer bit with Chaotic Maps" class="work-thumbnail" src="https://attachments.academia-assets.com/32103721/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/4805897/A_Secured_Image_with_Pseudorandom_Permutation_Using_longer_bit_with_Chaotic_Maps">A Secured Image with Pseudorandom Permutation Using longer bit with Chaotic Maps</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Today's research on image in internet, security of images and videos became an important problem....</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">Today's research on image in internet, security of images and videos became an important problem. This manuscript designs an image encryption algorithm. We recommend a new image secured algorithm using a large pseudorandom permutation which is combinatorial generated from small permutation matrices based on chaotic maps. We are using longer pseudorandom bits for encryptions. The random-like nature of chaos is effectively spread into encrypted images by using the permutation matrix. This shows that the proposed encryption scheme provides comparable security with that of the conventional image encryption schemes based on Baker map or Logistic map.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="7962c30106aea2ff812e53df47e2bae0" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103721,"asset_id":4805897,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103721/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="4805897"><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="4805897"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805897; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805897]").text(description); $(".js-view-count[data-work-id=4805897]").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 = 4805897; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805897']"); 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: "7962c30106aea2ff812e53df47e2bae0" } } $('.js-work-strip[data-work-id=4805897]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805897,"title":"A Secured Image with Pseudorandom Permutation Using longer bit with Chaotic Maps","internal_url":"https://www.academia.edu/4805897/A_Secured_Image_with_Pseudorandom_Permutation_Using_longer_bit_with_Chaotic_Maps","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103721,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103721/thumbnails/1.jpg","file_name":"d113903.pdf","download_url":"https://www.academia.edu/attachments/32103721/download_file","bulk_download_file_name":"A_Secured_Image_with_Pseudorandom_Permut.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103721/d113903-libre.pdf?1391440708=\u0026response-content-disposition=attachment%3B+filename%3DA_Secured_Image_with_Pseudorandom_Permut.pdf\u0026Expires=1740161882\u0026Signature=ePSb9A~ROszPKbngyG6uoZHUr9uiyOe3THrB0ymFTd9BEroXbfs69XajgPhUF3vWoUx9nqI1wuRMQ5tvQE07-ZYQN-v2rxp2WiB3~b3ZdNUQ89ABu~r6hkk7Y6jG80uc2hny3IGToFEA5hMIlJXHB~DHNASRwxkt9e4epdqQRMBFW-uNkSEHRv1PEvzgMZg9iRxleEKkuDqbPgvgMwBtvWWJjREJ3abnDoQ-HMXW4pF7pC5rwaQQMvVLoGyfIkCelzSDPRireKtPkL~S50rXUIk1V0tdNXkl4FHmkOiT~HK-l6xZIeYFMz4FiRj2eGovy6LZez9yUBjgfLnFH7bSRQ__\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="4805896"><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/4805896/A_comparative_study_of_some_images_watermarking_algorithms"><img alt="Research paper thumbnail of A comparative study of some images watermarking algorithms" class="work-thumbnail" src="https://attachments.academia-assets.com/32103725/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/4805896/A_comparative_study_of_some_images_watermarking_algorithms">A comparative study of some images watermarking algorithms</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The advancement of transfer technology and sharing of digital data has made of the protection 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">The advancement of transfer technology and sharing of digital data has made of the protection of intellectual property a pressing need. The concept of digital watermarking was emerged as a solution to this problem. This new technology involves inserting a mark in the image (watermark), which characterizes the owner. The insertion can be done in a different manner depending on the length of the message to be inserted and the desired robustness. In this paper we will simulate some watermarking algorithms and their resistance during extraction of the mark, to two types of attacks (Gaussian noise, rotation 90 掳) , subjected to the watermarked image while providing the experimental results and the difference between each of these algorithms.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="67efe06e64dddbb798c72f12e6d9b174" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103725,"asset_id":4805896,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103725/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="4805896"><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="4805896"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805896; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805896]").text(description); $(".js-view-count[data-work-id=4805896]").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 = 4805896; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805896']"); 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: "67efe06e64dddbb798c72f12e6d9b174" } } $('.js-work-strip[data-work-id=4805896]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805896,"title":"A comparative study of some images watermarking algorithms","internal_url":"https://www.academia.edu/4805896/A_comparative_study_of_some_images_watermarking_algorithms","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103725,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103725/thumbnails/1.jpg","file_name":"d113901.pdf","download_url":"https://www.academia.edu/attachments/32103725/download_file","bulk_download_file_name":"A_comparative_study_of_some_images_water.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103725/d113901-libre.pdf?1391429556=\u0026response-content-disposition=attachment%3B+filename%3DA_comparative_study_of_some_images_water.pdf\u0026Expires=1740161882\u0026Signature=MdGGEGPqcONG05t13FfAwuXYLEqwL8VhYKvS~R-bNNFm9gseyHYuB2TArc1Hchtg5Hw-C1Rzy5RvcOpDcR3OVXluga~1J5fr0xkk3NyzxD4cx4W7MBsdUwAgijG0-eMYTniEXa-KHmJS8Rly1A1ZOwUGdT~AHYErDKt1pQ9MO8xjxKTD~1EWzO~ywDJrIYgd1SCxGWAPN1vy4Xh9nJQUgCr8FbWj8vae47reP74LMGlNUWGeSCogSokBzmu3B8eWWALPZMuvPtSVR2D9xKsxe9KIqw6MJ-BxTxbotVPjvFPd2M8fYQnIA-Pk2PWQgPbNOXzro-NgKSzXRvDT8MQwmw__\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="4805879"><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/4805879/Handwritten_Isolated_Digit_Recognition_Using_Artificial_Neural_Networks"><img alt="Research paper thumbnail of Handwritten Isolated Digit Recognition Using Artificial Neural Networks" class="work-thumbnail" src="https://attachments.academia-assets.com/32103711/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/4805879/Handwritten_Isolated_Digit_Recognition_Using_Artificial_Neural_Networks">Handwritten Isolated Digit Recognition Using Artificial Neural Networks</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">A new mechanism proposes the use of Artificial Neural Network (ANN) models for recognizing handwr...</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">A new mechanism proposes the use of Artificial Neural Network (ANN) models for recognizing handwritten isolated digits and also presents new techniques for to extract digits from scanned digits images. Remove the slope and slant from handwritten isolated digits and normalize the size of Digit images with our proposed methods. Experiments have been conducted on handwritten isolated digits and the achieved recognizing rates up to 99%.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="704b679a6b8b8775611ee253e23cd392" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103711,"asset_id":4805879,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103711/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="4805879"><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="4805879"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805879; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805879]").text(description); $(".js-view-count[data-work-id=4805879]").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 = 4805879; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805879']"); 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: "704b679a6b8b8775611ee253e23cd392" } } $('.js-work-strip[data-work-id=4805879]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805879,"title":"Handwritten Isolated Digit Recognition Using Artificial Neural Networks","internal_url":"https://www.academia.edu/4805879/Handwritten_Isolated_Digit_Recognition_Using_Artificial_Neural_Networks","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103711,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103711/thumbnails/1.jpg","file_name":"cs113905.pdf","download_url":"https://www.academia.edu/attachments/32103711/download_file","bulk_download_file_name":"Handwritten_Isolated_Digit_Recognition_U.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103711/cs113905-libre.pdf?1391469806=\u0026response-content-disposition=attachment%3B+filename%3DHandwritten_Isolated_Digit_Recognition_U.pdf\u0026Expires=1740161882\u0026Signature=UEN8bcr5Mc7VhHmbEnDu0muSSnCk65KcAjB65eE1tO410r3Dv7WeowHbIQJPfje-UQ0B76k3HSbjKA5m-nTXXwGL5vjU0rqyhraBFY4QgkeiXkaq9jEXpqAL7Wm4FLneIDWtWXMZydBYhWbePNF9QL2efr0c9~vM8Ly697xjZAYO7MPB3mEdXFqJ22GX0q5cT3P9hrbFlv6y-ZOpSa-1nwkJU5MNsoH7FROZGBBmWjVCWa~sjsfttzF-ERyhC9yYkUvjDGxPrZNMcX4VRFYfV2y7ricjfRtusd7OkmyJKEii8KHXADfRf1er2wQnuYqnI59vtzPPEn1vOoUJ58Xw-w__\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="4805878"><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/4805878/Quality_of_Service_Assurance_in_Mobile_Ad_Hoc_Networks"><img alt="Research paper thumbnail of Quality of Service Assurance in Mobile Ad-Hoc Networks" class="work-thumbnail" src="https://attachments.academia-assets.com/32103710/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/4805878/Quality_of_Service_Assurance_in_Mobile_Ad_Hoc_Networks">Quality of Service Assurance in Mobile Ad-Hoc Networks</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Mobile ad-hoc network (MANET) is a peer-to-peer wireless network. They are selfconfiguring, capab...</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">Mobile ad-hoc network (MANET) is a peer-to-peer wireless network. They are selfconfiguring, capable of self-directed operation and hastily deployable. In MANET nodes communicate with each other without the use of topology. Nodes are itinerant, topology can be very dynamic and nodes must be able to relay traffic because corresponding nodes might be out of range. The dynamic nature of MANET makes network open to attacks and unreliability. Routing is always the most noteworthy element for any networks. Node misbehaviour due to selfish or malicious intention could significantly degrade the performance of MANET. We focus on trust management framework, which is intended to cope with misbehaviour problem of node and increase the performance of MANETs. A trust-based system can be used to track this misbehaving of nodes, spot them and isolate them from routing and provide reliability. In this paper a Trust Based Reliable AODV [TBRAODV] protocol is presented which implements a trust value for each node. For every node trust value is calculated and based trust value nodes are allowed to participate in routing or else identified to become a misbehaving node. This augments reliability in AODV routing and results in increase of PDR, decrease in delay and maintains throughput. This work is implemented and simulated on NS-2.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="fef2c2421cbcc56d702239550e3a817a" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103710,"asset_id":4805878,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103710/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="4805878"><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="4805878"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805878; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805878]").text(description); $(".js-view-count[data-work-id=4805878]").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 = 4805878; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805878']"); 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: "fef2c2421cbcc56d702239550e3a817a" } } $('.js-work-strip[data-work-id=4805878]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805878,"title":"Quality of Service Assurance in Mobile Ad-Hoc Networks","internal_url":"https://www.academia.edu/4805878/Quality_of_Service_Assurance_in_Mobile_Ad_Hoc_Networks","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103710,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103710/thumbnails/1.jpg","file_name":"cs113904.pdf","download_url":"https://www.academia.edu/attachments/32103710/download_file","bulk_download_file_name":"Quality_of_Service_Assurance_in_Mobile_A.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103710/cs113904-libre.pdf?1391489130=\u0026response-content-disposition=attachment%3B+filename%3DQuality_of_Service_Assurance_in_Mobile_A.pdf\u0026Expires=1740161882\u0026Signature=Ib-tNjjrzpdwg5xTY6KJJapW-C2gS~Bs2jlHjkWF5T3YayW037SyAD7FZLNSWkJ90BEH130gcTCQ3GKYDgX4O3l2p6Afjbogpgtk9wWKBLlp~IFaWTRfk-r5i6KGmKUO2a2Qnn55-Sm0CQo4Bc6two-daZeoBfnbD2V3uyeGsjVVzVJYzqzc6mSa7~e~uYoDocLf5tWoPPI6KPU9nTrJI-E0ltOCrd3QiNM05a28ssLSparQ9q8fIHOA2MOcXg8T52yv9FkNqoTksZ078h5Atx-nVj99f8XVAXQAlPkaQQ~o0HjyxWlPSTwwI1cfBUB4LGUQdRnyUxTJftZxueKkdA__\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="4805850"><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/4805850/Deployment_of_Wireless_Sensor_Actuator_Network_System_to_Monitor_Off_shore_Deep_Sea_Oil_Well"><img alt="Research paper thumbnail of Deployment of Wireless Sensor Actuator Network System to Monitor Off-shore Deep Sea Oil Well" class="work-thumbnail" src="https://attachments.academia-assets.com/32103690/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/4805850/Deployment_of_Wireless_Sensor_Actuator_Network_System_to_Monitor_Off_shore_Deep_Sea_Oil_Well">Deployment of Wireless Sensor Actuator Network System to Monitor Off-shore Deep Sea Oil Well</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">In recent times, oil monitoring and exploration activities have gained importance considering the...</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 recent times, oil monitoring and exploration activities have gained importance considering the fact that in India alone, the oil import is 62 percent of the total imports. Thus seismic technology is being developed and used to get better estimate of the oil prospects.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="9e0853cc61b16a5b8ee0766f220c4779" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103690,"asset_id":4805850,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103690/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="4805850"><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="4805850"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805850; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805850]").text(description); $(".js-view-count[data-work-id=4805850]").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 = 4805850; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805850']"); 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: "9e0853cc61b16a5b8ee0766f220c4779" } } $('.js-work-strip[data-work-id=4805850]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805850,"title":"Deployment of Wireless Sensor Actuator Network System to Monitor Off-shore Deep Sea Oil Well","internal_url":"https://www.academia.edu/4805850/Deployment_of_Wireless_Sensor_Actuator_Network_System_to_Monitor_Off_shore_Deep_Sea_Oil_Well","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103690,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103690/thumbnails/1.jpg","file_name":"cs113903.pdf","download_url":"https://www.academia.edu/attachments/32103690/download_file","bulk_download_file_name":"Deployment_of_Wireless_Sensor_Actuator_N.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103690/cs113903-libre.pdf?1391546831=\u0026response-content-disposition=attachment%3B+filename%3DDeployment_of_Wireless_Sensor_Actuator_N.pdf\u0026Expires=1740161882\u0026Signature=EXhGL6gXHGiuW68HCli26DJu08RKlszN6L7qMpSXKhopAtFYi8UFuALFwo2SYF5lp3ISDzY8AHr3ploFx259owALgOJlfH~1AMvaTfjBIGYr6c0~aNh~EbPOhQOAwUjNzk2jQpXjCOFJKWz9yNQNHv~iRj~2Ko-mLIH6YuOySXOsZBW3QJgcxyyA1ovDZNuCmZWD2afvWZQUYX2ipYBGsKsATnBjOT8l3dmx1tY4Sm0-GClJCs~htoHdCyylDDzi-2LdQPyIxJ~nMMsr5fHKkz8PTBD7YrXObA3ze1F~4Fi9-uTnMwwLyuy6qPTkr4dF9~jKFsauyg78bG0y6npICQ__\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="4805839"><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/4805839/AN_ANALYSIS_OF_HEURISTIC_SEARCH_TECHNIQUES_IN_EVOLVING_AWALE_GAME_PLAYER"><img alt="Research paper thumbnail of AN ANALYSIS OF HEURISTIC SEARCH TECHNIQUES IN EVOLVING AWALE GAME PLAYER" class="work-thumbnail" src="https://attachments.academia-assets.com/32103687/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/4805839/AN_ANALYSIS_OF_HEURISTIC_SEARCH_TECHNIQUES_IN_EVOLVING_AWALE_GAME_PLAYER">AN ANALYSIS OF HEURISTIC SEARCH TECHNIQUES IN EVOLVING AWALE GAME PLAYER</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Game playing is an interesting aspect of computer systems and there are many algorithms being pro...</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">Game playing is an interesting aspect of computer systems and there are many algorithms being proposed and developed in this area. Evaluation of these techniques becomes a very crucial task in game playing. This paper studies the respective performance of various popular heuristic techniques against the Awale shareware and compares their results against each other.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="dff4485fcf492e06db705cb1c8a2959a" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103687,"asset_id":4805839,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103687/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="4805839"><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="4805839"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805839; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805839]").text(description); $(".js-view-count[data-work-id=4805839]").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 = 4805839; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805839']"); 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: "dff4485fcf492e06db705cb1c8a2959a" } } $('.js-work-strip[data-work-id=4805839]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805839,"title":"AN ANALYSIS OF HEURISTIC SEARCH TECHNIQUES IN EVOLVING AWALE GAME PLAYER","internal_url":"https://www.academia.edu/4805839/AN_ANALYSIS_OF_HEURISTIC_SEARCH_TECHNIQUES_IN_EVOLVING_AWALE_GAME_PLAYER","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103687,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103687/thumbnails/1.jpg","file_name":"cs113902.pdf","download_url":"https://www.academia.edu/attachments/32103687/download_file","bulk_download_file_name":"AN_ANALYSIS_OF_HEURISTIC_SEARCH_TECHNIQU.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103687/cs113902-libre.pdf?1391460313=\u0026response-content-disposition=attachment%3B+filename%3DAN_ANALYSIS_OF_HEURISTIC_SEARCH_TECHNIQU.pdf\u0026Expires=1740161882\u0026Signature=SoLRx5Rk3F17xTjJICmq5p6sfVzdDCHLajM3N1WGzjS~wiyl3erNzRbASlBC4UrwPfdv~lESQjUcSq5JuVJWTQqDhm8jiLUi66JDvnhk1boGPLylzpHabnkP5~HF7ysa8z7KnqcaJdFlPocHwoweF077PEx2w4aoKE-ImQK4qBk~tBXQLOd7mt2NkMN4gRxSvCcMcyGPT8InHhWdovtHZADhE6nMJgfpUdAHLyxvBMvWm9WVwXgfoDzMGdnqdm0Z3rL5BDLNRGcCIDiaS2ohff7--q1Ayk3Gfng-QEok7l9nLVmWSmLvXELpg6~exclWNka41zIOLXy4jtL3QcDfXQ__\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="4805836"><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/4805836/Impact_of_Malicious_Nodes_Concentration_on_MANET_performance"><img alt="Research paper thumbnail of Impact of Malicious Nodes Concentration on MANET performance" class="work-thumbnail" src="https://attachments.academia-assets.com/32103684/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/4805836/Impact_of_Malicious_Nodes_Concentration_on_MANET_performance">Impact of Malicious Nodes Concentration on MANET performance</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The communication in Mobile Ad hoc Networks (MANET) is multi-hop in nature i.e. each node relays ...</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 communication in Mobile Ad hoc Networks (MANET) is multi-hop in nature i.e. each node relays data packets of other nodes by spending its own resources such as battery power, processing speed and bandwidth etc. Ideally each node in MANET is supposed to perform this community service truthfully but in reality some nodes may try to disrupt the normal functioning of the network. The reasons for the same may be low residual battery power or rogue intention of a node. This paper is an effort to study the impact of malicious nodes concentration on MANET performance on three routing protocols i.e. AODV, DYMO and DSR by using QualNet as simulation tool. The results show that as the concentration of malicious nodes in the range of 30 to 40 % the impact on the performance metrics is maximum.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="cd40ed76e87db126b34046bd77e0f8ac" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103684,"asset_id":4805836,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103684/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="4805836"><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="4805836"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805836; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805836]").text(description); $(".js-view-count[data-work-id=4805836]").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 = 4805836; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805836']"); 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: "cd40ed76e87db126b34046bd77e0f8ac" } } $('.js-work-strip[data-work-id=4805836]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805836,"title":"Impact of Malicious Nodes Concentration on MANET performance","internal_url":"https://www.academia.edu/4805836/Impact_of_Malicious_Nodes_Concentration_on_MANET_performance","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103684,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103684/thumbnails/1.jpg","file_name":"cs113901.pdf","download_url":"https://www.academia.edu/attachments/32103684/download_file","bulk_download_file_name":"Impact_of_Malicious_Nodes_Concentration.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103684/cs113901-libre.pdf?1391108097=\u0026response-content-disposition=attachment%3B+filename%3DImpact_of_Malicious_Nodes_Concentration.pdf\u0026Expires=1740161882\u0026Signature=UkwRm~JJzN5GiOdBcXtlCutbvb2RF1w7SlF90w4bbPGGGun3FcHh1Q4iy3iyx2l4HDMW7o29uI7aimnMk-wCo5FAZrwjpe0IuB90GwmFUE04tpMtUJpTmmoGFAFSFmGTGfgNf3xnt7vVb4TW-m7tGioMqZOAPn0oobZ4bLPc6FvkHc03eGbEOV6FNJAl9tFckrqqVApcvTxgY56hJZ8XNcXwzds5qRDFR4WOTJD-GIXIPCRm75Nq48wDmW-X9UxQGjgqFIrd3Lsqa9UjS2CDfhXj5XT12CPEZuC-P6Q54wNrXW-w-biqrCM4wz3F-rlYzb6TfCesBJjChOxaBsl3Jg__\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="4805586"><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/4805586/Coverage_of_WCDMA_Network_Using_Different_Modulation_Techniques_with_Soft_and_Hard_Decision_Decoder"><img alt="Research paper thumbnail of Coverage of WCDMA Network Using Different Modulation Techniques with Soft and Hard Decision Decoder" class="work-thumbnail" src="https://attachments.academia-assets.com/32103559/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/4805586/Coverage_of_WCDMA_Network_Using_Different_Modulation_Techniques_with_Soft_and_Hard_Decision_Decoder">Coverage of WCDMA Network Using Different Modulation Techniques with Soft and Hard Decision Decoder</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The wideband code division multiple access (WCDMA) based 3G cellular mobile wireless networks are...</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 wideband code division multiple access (WCDMA) based 3G cellular mobile wireless networks are expected to provide a diverse range of multimedia services to mobile users with guaranteed quality of service (QoS). To serve diverse quality of service requirements of these networks it necessitates new radio resource management strategies for effective utilization of network resources with coding schemes. In this paper coverage area for voice traffic and with different modulation techniques, coding schemes and decision decoder are discussed. These discussions are to improve the coverage area in the mobile communication system. This paper is mainly focuses on coverage area of WCDMA system using link budget calculation with different modulation, coding schemes and decision decoder. Simulation results demonstrate coverage extension for voice service with different modulation,coding scheme, soft and hard decision decoder using appropriate Bit error rate (BER) to maintain QoS of the voice.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="c5c0cb1965d25137bf96ec5335545f80" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103559,"asset_id":4805586,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103559/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="4805586"><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="4805586"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805586; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805586]").text(description); $(".js-view-count[data-work-id=4805586]").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 = 4805586; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805586']"); 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: "c5c0cb1965d25137bf96ec5335545f80" } } $('.js-work-strip[data-work-id=4805586]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805586,"title":"Coverage of WCDMA Network Using Different Modulation Techniques with Soft and Hard Decision Decoder","internal_url":"https://www.academia.edu/4805586/Coverage_of_WCDMA_Network_Using_Different_Modulation_Techniques_with_Soft_and_Hard_Decision_Decoder","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103559,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103559/thumbnails/1.jpg","file_name":"113807.pdf","download_url":"https://www.academia.edu/attachments/32103559/download_file","bulk_download_file_name":"Coverage_of_WCDMA_Network_Using_Differen.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103559/113807-libre.pdf?1391533709=\u0026response-content-disposition=attachment%3B+filename%3DCoverage_of_WCDMA_Network_Using_Differen.pdf\u0026Expires=1740161882\u0026Signature=N25lhYBmu4ZGxzXDm0gU-Iwzgavt-OPfYU7yxnV5~o8ETvJWGUvPA-GXlybgT4baPat1i6NmxM2NxnS5dF3labELv3DFcbeV98Gc1e1WlPGgEbfr5v8mTmdwyXoO-AHN5fHb746XXk2EyOhWZr-2ecylH-lKd2gzJSmeQ3rVUZX4S7ABESnNBUqHUc92aj1GWhvfqEou70kBZNcDpQLWmz78rQMmll3X3Hp-VssWgqM2JcQz5O7PmD-u-axaXL1pDfkp0KKxE3WklquD5lTuce6fMlQxH8TDUqee0vMUfQVKSBMxkVlQstdrhGzc2BJXjVXWUYgB4N-0F~Y213NzcQ__\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="4805576"><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/4805576/The_Escalating_Nigeria_National_Security_Challenge_Smart_Objects_and_Internet_Of_Things_to_the_rescue"><img alt="Research paper thumbnail of The Escalating Nigeria National Security Challenge: Smart Objects and Internet-Of-Things to the rescue" class="work-thumbnail" src="https://attachments.academia-assets.com/32103550/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/4805576/The_Escalating_Nigeria_National_Security_Challenge_Smart_Objects_and_Internet_Of_Things_to_the_rescue">The Escalating Nigeria National Security Challenge: Smart Objects and Internet-Of-Things to the rescue</a></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="b5008d87f863fab2c1471b399427800b" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103550,"asset_id":4805576,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103550/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="4805576"><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="4805576"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805576; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805576]").text(description); $(".js-view-count[data-work-id=4805576]").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 = 4805576; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805576']"); 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: "b5008d87f863fab2c1471b399427800b" } } $('.js-work-strip[data-work-id=4805576]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805576,"title":"The Escalating Nigeria National Security Challenge: Smart Objects and Internet-Of-Things to the rescue","internal_url":"https://www.academia.edu/4805576/The_Escalating_Nigeria_National_Security_Challenge_Smart_Objects_and_Internet_Of_Things_to_the_rescue","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103550,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103550/thumbnails/1.jpg","file_name":"113806.pdf","download_url":"https://www.academia.edu/attachments/32103550/download_file","bulk_download_file_name":"The_Escalating_Nigeria_National_Security.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103550/113806-libre.pdf?1391519657=\u0026response-content-disposition=attachment%3B+filename%3DThe_Escalating_Nigeria_National_Security.pdf\u0026Expires=1740161882\u0026Signature=arP7Udr80IMsGXai03M8EMd-9zdkPApCXIZAqzCevopOb3ZLL-i332u7ZdqINg8D~LoDCt6lCJpAhl3XCyN0uYb86Y3t8Mwyce-a1DYd~8FlIRkL95CMwxA5RtZxW-ZpDIutNRSAWJe~Kj0F96TjmeFjxEz-oXZheLozcX~rCLiBum0F8jir-NtYe6PzXm2-~LrmvoVpL-8M9GoDMh85nWbiewE~BjjjzhM4KHj~r2xYcUpGl80BVRRHBXqi3LPFIy3hP3HBdMOurJwxooWje0RCdLmj58x~w8q7GVAaCdXb6fvXvh50duA9o1UGFOjnViDoJbRjCY1NtvGsifV9rg__\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="4805564"><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/4805564/Performance_Analysis_and_Simulation_of_OLSR_Routing_Protocol_in_MANET"><img alt="Research paper thumbnail of Performance Analysis and Simulation of OLSR Routing Protocol in MANET" class="work-thumbnail" src="https://attachments.academia-assets.com/32103535/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/4805564/Performance_Analysis_and_Simulation_of_OLSR_Routing_Protocol_in_MANET">Performance Analysis and Simulation of OLSR Routing Protocol in MANET</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Mobile ad hoc network is a collection of wireless nodes that are communicate other nodes (router)...</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">Mobile ad hoc network is a collection of wireless nodes that are communicate other nodes (router) without using access point, infrastructure . Mobile ad-hoc network is an autonomous system that means no need for depaentd other nodes it have own capability to handle and controlling all funcitionlity, to sending and receiving all information form one device to other device. MANET has power full feature that controlling itself by dynamic nature, multihop,low power and configuration of the system. In this paper we analyzing, simulation and implements the TC messages and HELLO Message by MPR of OLSR routing performance checked at 200 nodes on Qualnet 5.0.2 simulator. In Qualnet simulator to simulate and implement the performance of OLSR routing protocols takes various performance metrics like hello message sent (HMS) , hello message received (HMR), TC message generated (TCMG), TC message replied (TCMR), TC messages received on Constant Bit Rate (CBR) using random waypoint model. In this paper check the performance OLSR routing protocol gives effective performance for lage networks.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="fb253e317d81f4ce3a5ea1d8efd2c846" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103535,"asset_id":4805564,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103535/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="4805564"><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="4805564"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805564; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805564]").text(description); $(".js-view-count[data-work-id=4805564]").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 = 4805564; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805564']"); 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: "fb253e317d81f4ce3a5ea1d8efd2c846" } } $('.js-work-strip[data-work-id=4805564]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805564,"title":"Performance Analysis and Simulation of OLSR Routing Protocol in MANET","internal_url":"https://www.academia.edu/4805564/Performance_Analysis_and_Simulation_of_OLSR_Routing_Protocol_in_MANET","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103535,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103535/thumbnails/1.jpg","file_name":"113805.pdf","download_url":"https://www.academia.edu/attachments/32103535/download_file","bulk_download_file_name":"Performance_Analysis_and_Simulation_of_O.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103535/113805-libre.pdf?1391462624=\u0026response-content-disposition=attachment%3B+filename%3DPerformance_Analysis_and_Simulation_of_O.pdf\u0026Expires=1740161882\u0026Signature=YzhZy~c9bYyn5MUmqzH7Cu9SmdzjVLoIWk~q8c4ELQcYqHPr8lcjPdQ5V8k6K6c-xCvJnq62VMgP4SOLCyKLEdzxxOdZt6eX5kBs~vxXrpTCuEj9URdXMfC5qe7P2Ban9bNKz9AgV2829Fcl65t4briJcQGV8uJda0-Ca93V20uCMhL1~pD0MQ3bB~A-hgRXizX1AcqTzvJpAUz87nhUEJSCAy-daZeqVY~M2rq-dSDvacA7OccFce6C4XlgYrw1ueiO6wJDZ4E4GX1lbqJNm5lU47uFqBqi5oFoll2EftCZPf4VdBoGjYJIbwDmUULEkArbzF9dAy5CU~6LI2X4tQ__\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="4805558"><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/4805558/BookyScholia_A_Methodology_for_the_Investigation_of_Expert_Systems"><img alt="Research paper thumbnail of BookyScholia: A Methodology for the Investigation of Expert Systems" class="work-thumbnail" src="https://attachments.academia-assets.com/32103523/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/4805558/BookyScholia_A_Methodology_for_the_Investigation_of_Expert_Systems">BookyScholia: A Methodology for the Investigation of Expert Systems</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Mathematicians agree that encrypted modalities are an interesting new topic in the field of softw...</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">Mathematicians agree that encrypted modalities are an interesting new topic in the field of software engineering, and systems engineers concur. In our research, we proved the deployment of consistent hashing, which embodies the intuitive principles of algorithms. Our focus in our research is not on whether the World Wide Web and SMPs are largely incompatible, but rather on presenting an analysis of interrupts (BookyScholia). Experiences with such solution and active networks disconfirm that access points and cache coherence can synchronize to realize this mission. W woulde show that performance in BookyScholia is not an obstacle. The characteristics of BookyScholia, in relation to those of more seminal systems, are famously more natural. Finally,we would focus our efforts on validating that the UNIVAC computer can be made probabilistic, cooperative, and scalable.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="6831a6cd02c5ff0b5437097e838d327f" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103523,"asset_id":4805558,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103523/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="4805558"><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="4805558"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805558; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805558]").text(description); $(".js-view-count[data-work-id=4805558]").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 = 4805558; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805558']"); 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: "6831a6cd02c5ff0b5437097e838d327f" } } $('.js-work-strip[data-work-id=4805558]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805558,"title":"BookyScholia: A Methodology for the Investigation of Expert Systems","internal_url":"https://www.academia.edu/4805558/BookyScholia_A_Methodology_for_the_Investigation_of_Expert_Systems","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103523,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103523/thumbnails/1.jpg","file_name":"113804.pdf","download_url":"https://www.academia.edu/attachments/32103523/download_file","bulk_download_file_name":"BookyScholia_A_Methodology_for_the_Inves.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103523/113804-libre.pdf?1391497273=\u0026response-content-disposition=attachment%3B+filename%3DBookyScholia_A_Methodology_for_the_Inves.pdf\u0026Expires=1740161882\u0026Signature=GzJdZr4j8v-tp7aFSPrMWBAGr2SH7EeYHn2VI4k4WzlQ6oYFK9k6yTXhMt6W6OI-OfQ4kkyzL9gQKVOWepm-DTUoAUB4MmdHstHy7Gvz2kI1g7gmRVbA2uL6I7Rnl36u5C1EEuX-8yKvXoUIzYDOrumif70aTZbWKGjgR9gzIWWl4V32ks-eJXZQ808ngCqe~aIjMNRh3RlG0GcxQ-trIleXQj94BRFkVFDTDwIirZuzfCju6PH8w8iWqzzjg-ZjadBPK1zQrAtDG1Va23V~FXEHBWV3lD7CNvzOeGPTxSh7hWlVr6IsYnHSFJ~nhiXYsMIlf42iLDeb00-iZJKXBg__\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="4805544"><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/4805544/A_Joint_Encryption_Watermarking_Algorithm_for_Secure_Image_Transfer"><img alt="Research paper thumbnail of A Joint Encryption/Watermarking Algorithm for Secure Image Transfer" class="work-thumbnail" src="https://attachments.academia-assets.com/32103504/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/4805544/A_Joint_Encryption_Watermarking_Algorithm_for_Secure_Image_Transfer">A Joint Encryption/Watermarking Algorithm for Secure Image Transfer</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">This paper presents a method combining encryption and watermarking for secure images transfer. Th...</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 presents a method combining encryption and watermarking for secure images transfer. The proposed solution gives access to the outcomes of the image integrity and of its origins as its attachment to one user even if the image is stored encrypted. This method is based on the combination of encryption algorithms publicprivate keys and secret keys, and watermarking. The algorithm for image encryption uses a secret key. We encrypt the secret key with an asymmetric algorithm. This encrypted secret key is then inserted into the encrypted image using watermark algorithm.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="ec48b0fa7ab8eec7acfba78d947d1fb4" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103504,"asset_id":4805544,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103504/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="4805544"><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="4805544"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805544; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805544]").text(description); $(".js-view-count[data-work-id=4805544]").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 = 4805544; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805544']"); 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: "ec48b0fa7ab8eec7acfba78d947d1fb4" } } $('.js-work-strip[data-work-id=4805544]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805544,"title":"A Joint Encryption/Watermarking Algorithm for Secure Image Transfer","internal_url":"https://www.academia.edu/4805544/A_Joint_Encryption_Watermarking_Algorithm_for_Secure_Image_Transfer","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103504,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103504/thumbnails/1.jpg","file_name":"113803.pdf","download_url":"https://www.academia.edu/attachments/32103504/download_file","bulk_download_file_name":"A_Joint_Encryption_Watermarking_Algorith.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103504/113803-libre.pdf?1391479972=\u0026response-content-disposition=attachment%3B+filename%3DA_Joint_Encryption_Watermarking_Algorith.pdf\u0026Expires=1740161883\u0026Signature=OvFwmncYoNp57Ge0xz9bCYIrwrUU3iNtF5Q2BxV3v2KstL60PoW2UVEfuqS6LKsFU3HUOpZ2GFvlbqtOZaQKwr9EA1q6G63WZn2aCj0vy0PMI0xy096BVJs0hdNvcVwRlmde0hJNwyJZsEUtvye95jJthAH6Djnz6h~pv5hmdHlpzVGjPAKwGmxZ~zPrWiKe-~z9T3MBUE84U-JlpOfHJ4PaPx1o9UztBt7D1bVqzXIKasYSLRDVhcKstFaDb~I27rv7uMmNeCt~DcY2FA2nejo~TALjR-kGI0T6n~sueVz9BJks2fIcoCa2xXYq0qzRVZzaTsZRcxAJTI9GmXO-EQ__\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="4805513"><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/4805513/Performance_Comparison_of_Modified_Variable_Step_Size_Leaky_LMS_Algorithm_for_Channel_Estimation_in_Noisy_Environment"><img alt="Research paper thumbnail of Performance Comparison of Modified Variable Step Size Leaky LMS Algorithm for Channel Estimation in Noisy Environment" class="work-thumbnail" src="https://attachments.academia-assets.com/32103488/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/4805513/Performance_Comparison_of_Modified_Variable_Step_Size_Leaky_LMS_Algorithm_for_Channel_Estimation_in_Noisy_Environment">Performance Comparison of Modified Variable Step Size Leaky LMS Algorithm for Channel Estimation in Noisy Environment</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Rate for different signal to noise ratio, also compare the proposed scheme with standard LMS chan...</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">Rate for different signal to noise ratio, also compare the proposed scheme with standard LMS channel estimation method</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="6a31ff5697dcde4cb476f70dbbb5fddd" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103488,"asset_id":4805513,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103488/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="4805513"><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="4805513"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805513; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805513]").text(description); $(".js-view-count[data-work-id=4805513]").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 = 4805513; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805513']"); 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: "6a31ff5697dcde4cb476f70dbbb5fddd" } } $('.js-work-strip[data-work-id=4805513]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805513,"title":"Performance Comparison of Modified Variable Step Size Leaky LMS Algorithm for Channel Estimation in Noisy Environment","internal_url":"https://www.academia.edu/4805513/Performance_Comparison_of_Modified_Variable_Step_Size_Leaky_LMS_Algorithm_for_Channel_Estimation_in_Noisy_Environment","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103488,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103488/thumbnails/1.jpg","file_name":"113802.pdf","download_url":"https://www.academia.edu/attachments/32103488/download_file","bulk_download_file_name":"Performance_Comparison_of_Modified_Varia.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103488/113802-libre.pdf?1392422519=\u0026response-content-disposition=attachment%3B+filename%3DPerformance_Comparison_of_Modified_Varia.pdf\u0026Expires=1740161883\u0026Signature=eZtp8ia8UVYT65k-i-KhlCfQZc9FaQ5FMpAiC4QozInD3kODyEaGzlEU5ZLgJIsYOaq8fvOr-8ABsmLClshcrZlq5-zb68M8RvNBV33YjI28AWVfDJGUes6WxSBFHVCQNl4YVrkBJBT8yRZjWnMvmmoX5xAMSL~KOJ-7PaSCBiKQbeWTcjjZC2zF-aEEjOMZnjLiVKnlg-9pep0XI~raubiaaJEeIJ6uC3tzrM91LRs5cOnRJAw~xm7eNBm9StRqw0XFmUCA1B9cnrrs4UqRLIeVWP0TWYR7oZQ40xyWHOFV8I3UcIqKAe5ipRL9guZGCtEYTJPHANq4n2Xf8HAt7Q__\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="4805313"><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/4805313/Study_of_Polarization_Mode_Dispersion_in_the_Optical_Digital_Connection_to_High_Bit_Rate"><img alt="Research paper thumbnail of Study of Polarization Mode Dispersion in the Optical Digital Connection to High Bit Rate" class="work-thumbnail" src="https://attachments.academia-assets.com/32103351/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/4805313/Study_of_Polarization_Mode_Dispersion_in_the_Optical_Digital_Connection_to_High_Bit_Rate">Study of Polarization Mode Dispersion in the Optical Digital Connection to High Bit Rate</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Polarization Mode Dispersion (PMD) is a factor which limits the bit rate of the optical transmiss...</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">Polarization Mode Dispersion (PMD) is a factor which limits the bit rate of the optical transmissions. The PMD is such an effect which is time broadening due to the dependence of the group velocity to the signal polarization. The deformation effects of the impulses become considerable from 40 Gb/s. This paper, we reviews the degrade PMD effect in the telecommunications optical connections to high bit rate, due to the evolution of quality factor (Q) according to the fiber length, bit rate and PMD coefficient , well as the impact PMD on the degree of polarization and electrical power, we discuss also the representation of the polarization state and PMD vector on the Poincare sphere.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="a97788b6d3438e3f78b9dae303c191f0" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":32103351,"asset_id":4805313,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/32103351/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="4805313"><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="4805313"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4805313; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4805313]").text(description); $(".js-view-count[data-work-id=4805313]").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 = 4805313; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='4805313']"); 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: "a97788b6d3438e3f78b9dae303c191f0" } } $('.js-work-strip[data-work-id=4805313]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":4805313,"title":"Study of Polarization Mode Dispersion in the Optical Digital Connection to High Bit Rate","internal_url":"https://www.academia.edu/4805313/Study_of_Polarization_Mode_Dispersion_in_the_Optical_Digital_Connection_to_High_Bit_Rate","owner_id":5624934,"coauthors_can_edit":true,"owner":{"id":5624934,"first_name":"AR","middle_initials":null,"last_name":"Publication","page_name":"ARMark","domain_name":"independent","created_at":"2013-09-18T12:32:26.332-07:00","display_name":"AR Publication","url":"https://independent.academia.edu/ARMark"},"attachments":[{"id":32103351,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/32103351/thumbnails/1.jpg","file_name":"113801.pdf","download_url":"https://www.academia.edu/attachments/32103351/download_file","bulk_download_file_name":"Study_of_Polarization_Mode_Dispersion_in.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/32103351/113801-libre.pdf?1391515653=\u0026response-content-disposition=attachment%3B+filename%3DStudy_of_Polarization_Mode_Dispersion_in.pdf\u0026Expires=1740161883\u0026Signature=I7CrBR-0QdxhA~QD4tXlWOILZqeByKsRKBVaXDWED1gQn59a~JBCXS0GV3A~hxKWzTzA-EXq9DTLvKbhQ~ZMPPYm4vhUlB0~sWEgxeGR8668NICbidhLi4ps7D7s9NjEBBOzkxosWBTjgj0hsKMJiwMc8I8y89kQD8JiWL5AAQGhMsgWG3u7raJnol8vDBIVRgKP6GtNiRUvOIkU4bUguOosh9lQhJQuvSHhGvWZJ4Y0mFCF26TgdXoPLynZZfi9foRhIpsSKxYwlNvSQ4w5wK-Bc0yd5wSohfk0YllduuXzYrUTuv~Y~Yt0tLFBXu6JchJeHOGn8O9LG61YXlJ2nA__\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: "7330ba84263be00b89bfd79ca72b9d8331a0c610a3a9a5b7a65c3ca45e06b851", });</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="jtYCIGbolTGtVGjBRAQrcUmMJ6tzRdrwaa5PsEsiRmgjcCP68wySlpKV1qmLHq1E0u5-oBH1B0YiSWXbW7Y4rg" 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/ARMark" 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="fM_fjORJy2XUDjHDE20JT7L3M2fd5rMlmv1tfd0RsL3Raf5Wca3MwuvPj6vcd496KZVqbL9WbpPRGkcWzYXOew" 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>