CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: quadratic mutual information</title> <meta name="description" content="Search results for: quadratic mutual information"> <meta name="keywords" content="quadratic mutual information"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="quadratic mutual information" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="quadratic mutual information"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 11359</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: quadratic mutual information</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11359</span> Key Frame Based Video Summarization via Dependency Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Janya%20Sainui">Janya Sainui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As a rapid growth of digital videos and data communications, video summarization that provides a shorter version of the video for fast video browsing and retrieval is necessary. Key frame extraction is one of the mechanisms to generate video summary. In general, the extracted key frames should both represent the entire video content and contain minimum redundancy. However, most of the existing approaches heuristically select key frames; hence, the selected key frames may not be the most different frames and/or not cover the entire content of a video. In this paper, we propose a method of video summarization which provides the reasonable objective functions for selecting key frames. In particular, we apply a statistical dependency measure called quadratic mutual informaion as our objective functions for maximizing the coverage of the entire video content as well as minimizing the redundancy among selected key frames. The proposed key frame extraction algorithm finds key frames as an optimization problem. Through experiments, we demonstrate the success of the proposed video summarization approach that produces video summary with better coverage of the entire video content while less redundancy among key frames comparing to the state-of-the-art approaches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=video%20summarization" title="video summarization">video summarization</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20frame%20extraction" title=" key frame extraction"> key frame extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=dependency%20measure" title=" dependency measure"> dependency measure</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information" title=" quadratic mutual information"> quadratic mutual information</a> </p> <a href="https://publications.waset.org/abstracts/75218/key-frame-based-video-summarization-via-dependency-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75218.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">266</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11358</span> Robust Image Registration Based on an Adaptive Normalized Mutual Information Metric</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Huda%20Algharib">Huda Algharib</a>, <a href="https://publications.waset.org/abstracts/search?q=Amal%20Algharib"> Amal Algharib</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanan%20Algharib"> Hanan Algharib</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Mohammad%20Alqudah"> Ali Mohammad Alqudah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Image registration is an important topic for many imaging systems and computer vision applications. The standard image registration techniques such as Mutual information/ Normalized mutual information -based methods have a limited performance because they do not consider the spatial information or the relationships between the neighbouring pixels or voxels. In addition, the amount of image noise may significantly affect the registration accuracy. Therefore, this paper proposes an efficient method that explicitly considers the relationships between the adjacent pixels, where the gradient information of the reference and scene images is extracted first, and then the cosine similarity of the extracted gradient information is computed and used to improve the accuracy of the standard normalized mutual information measure. Our experimental results on different data types (i.e. CT, MRI and thermal images) show that the proposed method outperforms a number of image registration techniques in terms of the accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20registration" title="image registration">image registration</a>, <a href="https://publications.waset.org/abstracts/search?q=mutual%20information" title=" mutual information"> mutual information</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20gradients" title=" image gradients"> image gradients</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20transformations" title=" image transformations"> image transformations</a> </p> <a href="https://publications.waset.org/abstracts/82815/robust-image-registration-based-on-an-adaptive-normalized-mutual-information-metric" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82815.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">248</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11357</span> Getting What You Paid For: Using Mutual Fund Governance to Predict the Activeness of Mutual Funds</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Matthew%20Morey">Matthew Morey</a>, <a href="https://publications.waset.org/abstracts/search?q=Aron%20Gottesman"> Aron Gottesman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper examines the relationship between mutual fund governance and the activeness of equity mutual funds. Using a fund’s corporate culture as a proxy for its governance and controlling for other variables, we find that funds with the better governance are significantly more active than other funds. Further, we find the probability of finding a highly active fund increases significantly as the governance of the fund improves. We also find some evidence that the probability of finding a closet index fund increases as the governance of the fund declines. These results demonstrate that mutual fund governance should be considered carefully when making mutual fund investment decisions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=active" title="active">active</a>, <a href="https://publications.waset.org/abstracts/search?q=share" title=" share"> share</a>, <a href="https://publications.waset.org/abstracts/search?q=mutual%20funds" title=" mutual funds"> mutual funds</a>, <a href="https://publications.waset.org/abstracts/search?q=economics" title=" economics"> economics</a> </p> <a href="https://publications.waset.org/abstracts/18918/getting-what-you-paid-for-using-mutual-fund-governance-to-predict-the-activeness-of-mutual-funds" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18918.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">335</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11356</span> Least Squares Solution for Linear Quadratic Gaussian Problem with Stochastic Approximation Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sie%20Long%20Kek">Sie Long Kek</a>, <a href="https://publications.waset.org/abstracts/search?q=Wah%20June%20Leong"> Wah June Leong</a>, <a href="https://publications.waset.org/abstracts/search?q=Kok%20Lay%20Teo"> Kok Lay Teo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Linear quadratic Gaussian model is a standard mathematical model for the stochastic optimal control problem. The combination of the linear quadratic estimation and the linear quadratic regulator allows the state estimation and the optimal control policy to be designed separately. This is known as the separation principle. In this paper, an efficient computational method is proposed to solve the linear quadratic Gaussian problem. In our approach, the Hamiltonian function is defined, and the necessary conditions are derived. In addition to this, the output error is defined and the least-square optimization problem is introduced. By determining the first-order necessary condition, the gradient of the sum squares of output error is established. On this point of view, the stochastic approximation approach is employed such that the optimal control policy is updated. Within a given tolerance, the iteration procedure would be stopped and the optimal solution of the linear-quadratic Gaussian problem is obtained. For illustration, an example of the linear-quadratic Gaussian problem is studied. The result shows the efficiency of the approach proposed. In conclusion, the applicability of the approach proposed for solving the linear quadratic Gaussian problem is highly demonstrated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=iteration%20procedure" title="iteration procedure">iteration procedure</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20squares%20solution" title=" least squares solution"> least squares solution</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20quadratic%20Gaussian" title=" linear quadratic Gaussian"> linear quadratic Gaussian</a>, <a href="https://publications.waset.org/abstracts/search?q=output%20error" title=" output error"> output error</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20approximation" title=" stochastic approximation"> stochastic approximation</a> </p> <a href="https://publications.waset.org/abstracts/113018/least-squares-solution-for-linear-quadratic-gaussian-problem-with-stochastic-approximation-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/113018.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">187</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11355</span> Mutual Information Based Image Registration of Satellite Images Using PSO-GA Hybrid Algorithm </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dipti%20Patra">Dipti Patra</a>, <a href="https://publications.waset.org/abstracts/search?q=Guguloth%20Uma"> Guguloth Uma</a>, <a href="https://publications.waset.org/abstracts/search?q=Smita%20Pradhan"> Smita Pradhan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Registration is a fundamental task in image processing. It is used to transform different sets of data into one coordinate system, where data are acquired from different times, different viewing angles, and/or different sensors. The registration geometrically aligns two images (the reference and target images). Registration techniques are used in satellite images and it is important in order to be able to compare or integrate the data obtained from these different measurements. In this work, mutual information is considered as a similarity metric for registration of satellite images. The transformation is assumed to be a rigid transformation. An attempt has been made here to optimize the transformation function. The proposed image registration technique hybrid PSO-GA incorporates the notion of Particle Swarm Optimization and Genetic Algorithm and is used for finding the best optimum values of transformation parameters. The performance comparision obtained with the experiments on satellite images found that the proposed hybrid PSO-GA algorithm outperforms the other algorithms in terms of mutual information and registration accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20registration" title="image registration">image registration</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20PSO-GA%20algorithm%20and%20mutual%20information" title=" hybrid PSO-GA algorithm and mutual information"> hybrid PSO-GA algorithm and mutual information</a> </p> <a href="https://publications.waset.org/abstracts/9683/mutual-information-based-image-registration-of-satellite-images-using-pso-ga-hybrid-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9683.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">408</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11354</span> Performance Analysis of MATLAB Solvers in the Case of a Quadratic Programming Generation Scheduling Optimization Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D%C3%A1vid%20Csercsik">Dávid Csercsik</a>, <a href="https://publications.waset.org/abstracts/search?q=P%C3%A9ter%20K%C3%A1d%C3%A1r"> Péter Kádár</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the case of the proposed method, the problem is parallelized by considering multiple possible mode of operation profiles, which determine the range in which the generators operate in each period. For each of these profiles, the optimization is carried out independently, and the best resulting dispatch is chosen. For each such profile, the resulting problem is a quadratic programming (QP) problem with a potentially negative definite Q quadratic term, and constraints depending on the actual operation profile. In this paper we analyze the performance of available MATLAB optimization methods and solvers for the corresponding QP. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimization" title="optimization">optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=MATLAB" title=" MATLAB"> MATLAB</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20programming" title=" quadratic programming"> quadratic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20dispatch" title=" economic dispatch"> economic dispatch</a> </p> <a href="https://publications.waset.org/abstracts/67656/performance-analysis-of-matlab-solvers-in-the-case-of-a-quadratic-programming-generation-scheduling-optimization-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67656.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">549</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11353</span> The Superior Performance of Investment Bank-Affiliated Mutual Funds</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michelo%20Obrey">Michelo Obrey</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traditionally, mutual funds have long been esteemed as stand-alone entities in the U.S. However, the prevalence of the fund families’ affiliation to financial conglomerates is eroding this striking feature. Mutual fund families' affiliation with financial conglomerates can potentially be an important source of superior performance or cost to the affiliated mutual fund investors. On the one hand, financial conglomerates affiliation offers the mutual funds access to abundant resources, better research quality, private material information, and business connections within the financial group. On the other hand, conflict of interest is bound to arise between the financial conglomerate relationship and fund management. Using a sample of U.S. domestic equity mutual funds from 1994 to 2017, this paper examines whether fund family affiliation to an investment bank help the affiliated mutual funds deliver superior performance through private material information advantage possessed by the investment banks or it costs affiliated mutual fund shareholders due to the conflict of interest. Robust to alternative risk adjustments and cross-section regression methodologies, this paper finds that the investment bank-affiliated mutual funds significantly outperform those of the mutual funds that are not affiliated with an investment bank. Interestingly the paper finds that the outperformance is confined to holding return, a return measure that captures the investment talent that is uninfluenced by transaction costs, fees, and other expenses. Further analysis shows that the investment bank-affiliated mutual funds specialize in hard-to-value stocks, which are not more likely to be held by unaffiliated funds. Consistent with the information advantage hypothesis, the paper finds that affiliated funds holding covered stocks outperform affiliated funds without covered stocks lending no support to the hypothesis that affiliated mutual funds attract superior stock-picking talent. Overall, the paper findings are consistent with the idea that investment banks maximize fee income by monopolistically exploiting their private information, thus strategically transferring performance to their affiliated mutual funds. This paper contributes to the extant literature on the agency problem in mutual fund families. It adds to this stream of research by showing that the agency problem is not only prevalent in fund families but also in financial organizations such as investment banks that have affiliated mutual fund families. The results show evidence of exploitation of synergies such as private material information sharing that benefit mutual fund investors due to affiliation with a financial conglomerate. However, this research has a normative dimension, allowing such incestuous behavior of insider trading and exploitation of superior information not only negatively affect the unaffiliated fund investors but also led to an unfair and unleveled playing field in the financial market. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mutual%20fund%20performance" title="mutual fund performance">mutual fund performance</a>, <a href="https://publications.waset.org/abstracts/search?q=conflicts%20of%20interest" title=" conflicts of interest"> conflicts of interest</a>, <a href="https://publications.waset.org/abstracts/search?q=informational%20advantage" title=" informational advantage"> informational advantage</a>, <a href="https://publications.waset.org/abstracts/search?q=investment%20bank" title=" investment bank"> investment bank</a> </p> <a href="https://publications.waset.org/abstracts/134432/the-superior-performance-of-investment-bank-affiliated-mutual-funds" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/134432.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">189</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11352</span> Hybrid EMPCA-Scott Approach for Estimating Probability Distributions of Mutual Information</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thuvanan%20Borvornvitchotikarn">Thuvanan Borvornvitchotikarn</a>, <a href="https://publications.waset.org/abstracts/search?q=Werasak%20Kurutach"> Werasak Kurutach</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mutual information (MI) is widely used in medical image registration. In the different medical images analysis, it is difficult to choose an optimal bins size number for calculating the probability distributions in MI. As the result, this paper presents a new adaptive bins number selection approach that named a hybrid EMPCA-Scott approach. This work combines an expectation maximization principal component analysis (EMPCA) and the modified Scott’s rule. The proposed approach solves the binning problem from the various intensity values in medical images. Experimental results of this work show the lower registration errors compared to other adaptive binning approaches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mutual%20information" title="mutual information">mutual information</a>, <a href="https://publications.waset.org/abstracts/search?q=EMPCA" title=" EMPCA"> EMPCA</a>, <a href="https://publications.waset.org/abstracts/search?q=Scott" title=" Scott"> Scott</a>, <a href="https://publications.waset.org/abstracts/search?q=probability%20distributions" title=" probability distributions"> probability distributions</a> </p> <a href="https://publications.waset.org/abstracts/57641/hybrid-empca-scott-approach-for-estimating-probability-distributions-of-mutual-information" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57641.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">249</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11351</span> Discretization of Cuckoo Optimization Algorithm for Solving Quadratic Assignment Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elham%20Kazemi">Elham Kazemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quadratic Assignment Problem (QAP) is one the combinatorial optimization problems about which research has been done in many companies for allocating some facilities to some locations. The issue of particular importance in this process is the costs of this allocation and the attempt in this problem is to minimize this group of costs. Since the QAP’s are from NP-hard problem, they cannot be solved by exact solution methods. Cuckoo Optimization Algorithm is a Meta-heuristicmethod which has higher capability to find the global optimal points. It is an algorithm which is basically raised to search a continuous space. The Quadratic Assignment Problem is the issue which can be solved in the discrete space, thus the standard arithmetic operators of Cuckoo Optimization Algorithm need to be redefined on the discrete space in order to apply the Cuckoo Optimization Algorithm on the discrete searching space. This paper represents the way of discretizing the Cuckoo optimization algorithm for solving the quadratic assignment problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Quadratic%20Assignment%20Problem%20%28QAP%29" title="Quadratic Assignment Problem (QAP)">Quadratic Assignment Problem (QAP)</a>, <a href="https://publications.waset.org/abstracts/search?q=Discrete%20Cuckoo%20Optimization%20Algorithm%20%28DCOA%29" title=" Discrete Cuckoo Optimization Algorithm (DCOA)"> Discrete Cuckoo Optimization Algorithm (DCOA)</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic%20algorithms" title=" meta-heuristic algorithms"> meta-heuristic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20algorithms" title=" optimization algorithms"> optimization algorithms</a> </p> <a href="https://publications.waset.org/abstracts/25249/discretization-of-cuckoo-optimization-algorithm-for-solving-quadratic-assignment-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25249.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">517</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11350</span> Sliding Mode Controlled Quadratic Boost Converter</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Viji%20Vijayakumar">Viji Vijayakumar</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Divya"> R. Divya</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Vivek"> A. Vivek</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with a quadratic boost converter which belongs to cascade boost family, controlled by sliding mode controller. In the cascade boost family, quadratic boost converter is the best trade-off when circuit complexity and modulator saturation is considered. Sliding mode control being a nonlinear control results in a robust and stable system when applied to switching converters which are inherently variable structured systems. The stability of this system is analyzed through Lyapunov’s approach. Analysis is done for load regulation, line regulation and step response of the system. Also these results are compared with that of PID controller based system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DC-DC%20converter" title="DC-DC converter">DC-DC converter</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20boost%20converter" title=" quadratic boost converter"> quadratic boost converter</a>, <a href="https://publications.waset.org/abstracts/search?q=sliding%20mode%20control" title=" sliding mode control"> sliding mode control</a>, <a href="https://publications.waset.org/abstracts/search?q=PID%20control" title=" PID control"> PID control</a> </p> <a href="https://publications.waset.org/abstracts/7140/sliding-mode-controlled-quadratic-boost-converter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7140.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">993</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11349</span> Interoperability Model Design of Smart Grid Power System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seon-Hack%20Hong">Seon-Hack Hong</a>, <a href="https://publications.waset.org/abstracts/search?q=Tae-Il%20Choi"> Tae-Il Choi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Interoperability is defined as systems, components, and devices developed by different entities smoothly exchanging information and functioning organically without mutual consultation, being able to communicate with each other and computer systems of the same type or different types, and exchanging information or the ability of two or more systems to exchange information and use the information exchanged without extra effort. Insufficiencies such as duplication of functions when developing systems and applications due to lack of interoperability in the electric power system and low efficiency due to a lack of mutual information transmission system between the inside of the application program and the design is improved, and the seamless linkage of newly developed systems is improved. Since it is necessary to secure interoperability for this purpose, we designed the smart grid-based interoperability standard model in this paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=interoperability" title="interoperability">interoperability</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20system" title=" power system"> power system</a>, <a href="https://publications.waset.org/abstracts/search?q=common%20information%20model" title=" common information model"> common information model</a>, <a href="https://publications.waset.org/abstracts/search?q=SCADA" title=" SCADA"> SCADA</a>, <a href="https://publications.waset.org/abstracts/search?q=IEEE2030" title=" IEEE2030"> IEEE2030</a>, <a href="https://publications.waset.org/abstracts/search?q=Zephyr" title=" Zephyr"> Zephyr</a> </p> <a href="https://publications.waset.org/abstracts/166219/interoperability-model-design-of-smart-grid-power-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/166219.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">124</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11348</span> Implementation of Integer Sub-Decomposition Method on Elliptic Curves with J-Invariant 1728</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Siti%20Noor%20Farwina%20Anwar">Siti Noor Farwina Anwar</a>, <a href="https://publications.waset.org/abstracts/search?q=Hailiza%20Kamarulhaili"> Hailiza Kamarulhaili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present the idea of implementing the Integer Sub-Decomposition (ISD) method on elliptic curves with j-invariant 1728. The ISD method was proposed in 2013 to compute scalar multiplication in elliptic curves, which remains to be the most expensive operation in Elliptic Curve Cryptography (ECC). However, the original ISD method only works on integer number field and solve integer scalar multiplication. By extending the method into the complex quadratic field, we are able to solve complex multiplication and implement the ISD method on elliptic curves with j-invariant 1728. The curve with j-invariant 1728 has a unique discriminant of the imaginary quadratic field. This unique discriminant of quadratic field yields a unique efficiently computable endomorphism, which later able to speed up the computations on this curve. However, the ISD method needs three endomorphisms to be accomplished. Hence, we choose all three endomorphisms to be from the same imaginary quadratic field as the curve itself, where the first endomorphism is the unique endomorphism yield from the discriminant of the imaginary quadratic field. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=efficiently%20computable%20endomorphism" title="efficiently computable endomorphism">efficiently computable endomorphism</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20scalar%20multiplication" title=" elliptic scalar multiplication"> elliptic scalar multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=j-invariant%201728" title=" j-invariant 1728"> j-invariant 1728</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20field" title=" quadratic field"> quadratic field</a> </p> <a href="https://publications.waset.org/abstracts/89234/implementation-of-integer-sub-decomposition-method-on-elliptic-curves-with-j-invariant-1728" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89234.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">200</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11347</span> The Application of Pareto Local Search to the Single-Objective Quadratic Assignment Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20Alsheddy">Abdullah Alsheddy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the employment of Pareto optimality as a strategy to help (single-objective) local search escaping local optima. Instead of local search, Pareto local search is applied to solve the quadratic assignment problem which is multi-objectivized by adding a helper objective. The additional objective is defined as a function of the primary one with augmented penalties that are dynamically updated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pareto%20optimization" title="Pareto optimization">Pareto optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objectivization" title=" multi-objectivization"> multi-objectivization</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20assignment%20problem" title=" quadratic assignment problem"> quadratic assignment problem</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20search" title=" local search"> local search</a> </p> <a href="https://publications.waset.org/abstracts/9877/the-application-of-pareto-local-search-to-the-single-objective-quadratic-assignment-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9877.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">466</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11346</span> Cryptography Over Sextic Extension with Cubic Subfield</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Chillali">A. Chillali</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Sahmoudi"> M. Sahmoudi </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we will give a method for encoding the elements of the ring of integers of sextic extension, namely L = Q(a,b) which is a rational quadratic over cubic field K =Q(a) where a^{2} is a rational square free integer and b is a root of irreducible polynomiale of degree 3. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coding" title="coding">coding</a>, <a href="https://publications.waset.org/abstracts/search?q=integral%20bases" title=" integral bases"> integral bases</a>, <a href="https://publications.waset.org/abstracts/search?q=sextic" title=" sextic"> sextic</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic" title=" quadratic"> quadratic</a> </p> <a href="https://publications.waset.org/abstracts/24264/cryptography-over-sextic-extension-with-cubic-subfield" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24264.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">297</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11345</span> Improved Mutual Inductance of Rogowski Coil Using Hexagonal Core</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Al-Sowayan">S. Al-Sowayan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Rogowski coils are increasingly used for measurement of AC and transient electric currents. Mostly used Rogowski coils now are with circular or rectangular cores. In order to increase the sensitivity of the measurement of Rogowski coil and perform smooth wire winding, this paper studies the effect of increasing the mutual inductance in order to increase the coil sensitivity by presenting the calculation and simulation of a Rogowski coil with equilateral hexagonal shaped core and comparing the resulted mutual inductance with commonly used core shapes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rogowski%20coil" title="Rogowski coil">Rogowski coil</a>, <a href="https://publications.waset.org/abstracts/search?q=mutual%20inductance" title=" mutual inductance"> mutual inductance</a>, <a href="https://publications.waset.org/abstracts/search?q=magnetic%20flux%20density" title=" magnetic flux density"> magnetic flux density</a>, <a href="https://publications.waset.org/abstracts/search?q=communication%20engineering" title=" communication engineering"> communication engineering</a> </p> <a href="https://publications.waset.org/abstracts/5443/improved-mutual-inductance-of-rogowski-coil-using-hexagonal-core" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5443.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">370</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11344</span> The Soliton Solution of the Quadratic-Cubic Nonlinear Schrodinger Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sarun%20Phibanchon">Sarun Phibanchon</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuttakarn%20Rattanachai"> Yuttakarn Rattanachai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The quadratic-cubic nonlinear Schrodinger equation can be explained the weakly ion-acoustic waves in magnetized plasma with a slightly non-Maxwellian electron distribution by using the Madelung's fluid picture. However, the soliton solution to the quadratic-cubic nonlinear Schrodinger equation is determined by using the direct integration. By the characteristics of a soliton, the solution can be claimed that it's a soliton by considering its time evolution and their collisions between two solutions. These results are shown by applying the spectral method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=soliton" title="soliton">soliton</a>, <a href="https://publications.waset.org/abstracts/search?q=ion-acoustic%20waves" title=" ion-acoustic waves"> ion-acoustic waves</a>, <a href="https://publications.waset.org/abstracts/search?q=plasma" title=" plasma"> plasma</a>, <a href="https://publications.waset.org/abstracts/search?q=spectral%20method" title=" spectral method"> spectral method</a> </p> <a href="https://publications.waset.org/abstracts/32663/the-soliton-solution-of-the-quadratic-cubic-nonlinear-schrodinger-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32663.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">411</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11343</span> Mutual Coupling Reduction between Patch Antenna Array Elements Using Metamaterial Z Shaped Resonators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Oossama%20Tabbabi">Oossama Tabbabi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mondher%20Labidi"> Mondher Labidi</a>, <a href="https://publications.waset.org/abstracts/search?q=Fethi%20Choubani"> Fethi Choubani</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20David"> J. David</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Modern wireless communication systems require compact design, low cost and simple structure antennas to insure reliability, agility, and high efficiency characteristics. This paper presents a microstrip antenna array designed for 8 GHz applications. To reduce the mutual coupling effects, a Z shape metamaterial structure was imprinted in the microstrip antenna array composed of two elements. Simulation results show the improvement of mutual coupling by adding Z shape metamaterial structure to the antenna substrate. The proposed structure reduces mutual coupling by 19 dB. The simulation has been performed by using HFSS simulator. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=antenna%20array" title="antenna array">antenna array</a>, <a href="https://publications.waset.org/abstracts/search?q=compact%20design" title=" compact design"> compact design</a>, <a href="https://publications.waset.org/abstracts/search?q=modern%20wireless%20communication" title=" modern wireless communication"> modern wireless communication</a>, <a href="https://publications.waset.org/abstracts/search?q=mutual%20coupling%20effects" title=" mutual coupling effects"> mutual coupling effects</a> </p> <a href="https://publications.waset.org/abstracts/42228/mutual-coupling-reduction-between-patch-antenna-array-elements-using-metamaterial-z-shaped-resonators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42228.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">343</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11342</span> Licensing in a Hotelling Model with Quadratic Transportation Costs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fehmi%20Bouguezzi">Fehmi Bouguezzi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studies optimal licensing regimes in a linear Hotelling model where firms are located at the end points of the city and where the transportation cost is not linear but quadratic. We study for that a more general cost function and we try to compare the findings with the results of the linear cost. We find the same optimal licensing regimes. A per unit royalty is optimal when innovation is not drastic and no licensing is better when innovation is drastic. We also find that no licensing is always better than fixed fee licensing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hotelling%20model" title="Hotelling model">Hotelling model</a>, <a href="https://publications.waset.org/abstracts/search?q=technology%20transfer" title=" technology transfer"> technology transfer</a>, <a href="https://publications.waset.org/abstracts/search?q=patent%20licensing" title=" patent licensing"> patent licensing</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20transportation%20cost" title=" quadratic transportation cost"> quadratic transportation cost</a> </p> <a href="https://publications.waset.org/abstracts/15248/licensing-in-a-hotelling-model-with-quadratic-transportation-costs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15248.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">349</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11341</span> A Low-Latency Quadratic Extended Domain Modular Multiplier for Bilinear Pairing Based on Non-Least Positive Multiplication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yulong%20Jia">Yulong Jia</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiang%20Zhang"> Xiang Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Ziyuan%20Wu"> Ziyuan Wu</a>, <a href="https://publications.waset.org/abstracts/search?q=Shiji%20Hu"> Shiji Hu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The calculation of bilinear pairing is the core of the SM9 algorithm, which relies on the underlying prime domain algorithm and the quadratic extension domain algorithm. Among the field algorithms, modular multiplication operation is the most time-consuming part. Therefore, the underlying modular multiplication algorithm is optimized to maximize the operation speed of bilinear pairings. This paper uses a modular multiplication method based on non-least positive (NLP) combined with Karatsuba and schoolbook multiplication to improve the Montgomery algorithm. At the same time, according to the characteristics of multiplication operation in the quadratic extension domain, a quadratic extension domain FP2-NLP modular multiplication algorithm for bilinear pairings is proposed, which effectively reduces the operation time of modular multiplication in the quadratic extension domain. The sub-expanded domain Fp₂ -NLP modular multiplication algorithm effectively reduces the operation time of modular multiplication under the second-expanded domain. The multiplication unit in the quadratic extension domain is implemented using SMIC55nm process, and two different implementation architectures are designed to cope with different application scenarios. Compared with the existing related literature, The output latency of this design can reach a minimum of 15 cycles. The shortest time for calculating the (AB+CD)r⁻¹ mod form is 37.5ns, and the comprehensive area-time product (AT) is 11400. The final R-ate pairing algorithm hardware accelerator consumes 2670k equivalent logic gates and 1.8ms computing time in 55nm process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sm9" title="sm9">sm9</a>, <a href="https://publications.waset.org/abstracts/search?q=hardware" title=" hardware"> hardware</a>, <a href="https://publications.waset.org/abstracts/search?q=NLP" title=" NLP"> NLP</a>, <a href="https://publications.waset.org/abstracts/search?q=Montgomery" title=" Montgomery"> Montgomery</a> </p> <a href="https://publications.waset.org/abstracts/194787/a-low-latency-quadratic-extended-domain-modular-multiplier-for-bilinear-pairing-based-on-non-least-positive-multiplication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/194787.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">7</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11340</span> NFC Communications with Mutual Authentication Based on Limited-Use Session Keys </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chalee%20Thammarat">Chalee Thammarat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile phones are equipped with increased short-range communication functionality called Near Field Communication (or NFC for short). NFC needs no pairing between devices but suitable for little amounts of data in a very restricted area. A number of researchers presented authentication techniques for NFC communications, however, they still lack necessary authentication, particularly mutual authentication and security qualifications. This paper suggests a new authentication protocol for NFC communication that gives mutual authentication between devices. The mutual authentication is a one of property, of security that protects replay and man-in-the-middle (MitM) attack. The proposed protocols deploy a limited-use offline session key generation and use of distribution technique to increase security and make our protocol lightweight. There are four sub-protocols: NFCAuthv1 is suitable for identification and access control and NFCAuthv2 is suitable for the NFC-enhanced phone by a POS terminal for digital and physical goods and services. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocols" title="cryptographic protocols">cryptographic protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=NFC" title=" NFC"> NFC</a>, <a href="https://publications.waset.org/abstracts/search?q=near%20field%20communications" title=" near field communications"> near field communications</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20protocols" title=" security protocols"> security protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=mutual%20authentication" title=" mutual authentication"> mutual authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20security" title=" network security"> network security</a> </p> <a href="https://publications.waset.org/abstracts/33236/nfc-communications-with-mutual-authentication-based-on-limited-use-session-keys" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33236.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">430</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11339</span> Impact of Macroeconomic Variables on Indian Mutual Funds: A Time Series Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sonali%20Agarwal">Sonali Agarwal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The investor perception about investment avenues is affected to a great degree by the current happenings, within the country, and on the global stage. The influencing events can range from government policies, bilateral trade agreements, election agendas, to changing exchange rates, appreciation and depreciation of currency, recessions, meltdowns, bankruptcies etc. The current research attempts to discover and unravel the effect of various macroeconomic variables (crude oil price, gold price, silver price and USD exchange rate) on the Indian mutual fund industry in general and the chosen funds (Axis Gold Fund, BSL Gold Fund, Kotak Gold Fund & SBI gold fund) in particular. Cointegration tests and Vector error correction equations prove that the chosen variables have strong effect on the NAVs (net asset values) of the mutual funds. However, the greatest influence is felt from the fund’s own past and current information and it is found that when an innovation of fund’s own lagged NAVs is given, variance caused is high that changes the current NAVs markedly. The study helps to highlight the interplay of macroeconomic variables and their repercussion on mutual fund industry. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cointegration" title="cointegration">cointegration</a>, <a href="https://publications.waset.org/abstracts/search?q=Granger%20causality" title=" Granger causality"> Granger causality</a>, <a href="https://publications.waset.org/abstracts/search?q=impulse%20response" title=" impulse response"> impulse response</a>, <a href="https://publications.waset.org/abstracts/search?q=macroeconomic%20variables" title=" macroeconomic variables"> macroeconomic variables</a>, <a href="https://publications.waset.org/abstracts/search?q=mutual%20funds" title=" mutual funds"> mutual funds</a>, <a href="https://publications.waset.org/abstracts/search?q=stationarity" title=" stationarity"> stationarity</a>, <a href="https://publications.waset.org/abstracts/search?q=unit%20root%20test" title=" unit root test"> unit root test</a>, <a href="https://publications.waset.org/abstracts/search?q=variance%20decomposition" title=" variance decomposition"> variance decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=VECM" title=" VECM"> VECM</a> </p> <a href="https://publications.waset.org/abstracts/63588/impact-of-macroeconomic-variables-on-indian-mutual-funds-a-time-series-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63588.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">244</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11338</span> The Tracking and Hedging Performances of Gold ETF Relative to Some Other Instruments in the UK</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abimbola%20Adedeji">Abimbola Adedeji</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Shauqi%20Zubir"> Ahmad Shauqi Zubir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper examines the profitability and risk between investing in gold exchange traded funds (ETFs) and gold mutual funds compares to gold prices. The main focus in determining whether there are similarities or differences between those financial products is the tracking error. The importance of understanding the similarities or differences between the gold ETFs, gold mutual funds and gold prices is derived from the fact that gold ETFs and gold mutual funds are used as substitutions for investors who are looking to profit from gold prices although they are short in capital. 10 hypotheses were tested. There are 3 types of tracking error used. Tracking error 1 and 3 gives results that differentiate between types of ETFs and mutual funds, hence yielding the answers in answering the hypotheses that were developed. However, tracking error 2 failed to give the answer that could shed light on the questions raised in this study. All of the results in tracking error 2 technique only telling us that the difference between the ups and downs of the financial instruments are similar, statistically to the physical gold prices movement. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=gold%20etf" title="gold etf">gold etf</a>, <a href="https://publications.waset.org/abstracts/search?q=gold%20mutual%20funds" title=" gold mutual funds"> gold mutual funds</a>, <a href="https://publications.waset.org/abstracts/search?q=tracking%20error" title=" tracking error"> tracking error</a> </p> <a href="https://publications.waset.org/abstracts/27595/the-tracking-and-hedging-performances-of-gold-etf-relative-to-some-other-instruments-in-the-uk" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27595.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">422</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11337</span> A Quadratic Approach for Generating Pythagorean Triples</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20K.%20Rahul%20Krishna">P. K. Rahul Krishna</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Sandeep%20Kumar"> S. Sandeep Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Jayanthi%20Sunder%20Raj"> Jayanthi Sunder Raj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article explores one of the important relations between numbers-the Pythagorean triples (triplets) which finds its application in distance measurement, construction of roads, towers, buildings and wherever Pythagoras theorem finds its application. The Pythagorean triples are numbers, that satisfy the condition “In a given set of three natural numbers, the sum of squares of two natural numbers is equal to the square of the other natural number”. There are numerous methods and equations to obtain the triplets, which have their own merits and demerits. Here, quadratic approach for generating triples uses the hypotenuse leg difference method. The advantage is that variables are few and finally only three independent variables are present. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=arithmetic%20progression" title="arithmetic progression">arithmetic progression</a>, <a href="https://publications.waset.org/abstracts/search?q=hypotenuse%20leg%20difference%20method" title=" hypotenuse leg difference method"> hypotenuse leg difference method</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20numbers" title=" natural numbers"> natural numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=Pythagorean%20triplets" title=" Pythagorean triplets"> Pythagorean triplets</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20equation" title=" quadratic equation"> quadratic equation</a> </p> <a href="https://publications.waset.org/abstracts/61275/a-quadratic-approach-for-generating-pythagorean-triples" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61275.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">206</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11336</span> Dynamic Economic Load Dispatch Using Quadratic Programming: Application to Algerian Electrical Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Graa">A. Graa</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20Ziane"> I. Ziane</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Benhamida"> F. Benhamida</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Souag"> S. Souag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a comparative analysis study of an efficient and reliable quadratic programming (QP) to solve economic load dispatch (ELD) problem with considering transmission losses in a power system. The proposed QP method takes care of different unit and system constraints to find optimal solution. To validate the effectiveness of the proposed QP solution, simulations have been performed using Algerian test system. Results obtained with the QP method have been compared with other existing relevant approaches available in literatures. Experimental results show a proficiency of the QP method over other existing techniques in terms of robustness and its optimal search. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=economic%20dispatch" title="economic dispatch">economic dispatch</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20programming" title=" quadratic programming"> quadratic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=Algerian%20network" title=" Algerian network"> Algerian network</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20load" title=" dynamic load"> dynamic load</a> </p> <a href="https://publications.waset.org/abstracts/23032/dynamic-economic-load-dispatch-using-quadratic-programming-application-to-algerian-electrical-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23032.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">565</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11335</span> Secure Network Coding-Based Named Data Network Mutual Anonymity Transfer Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tao%20Feng">Tao Feng</a>, <a href="https://publications.waset.org/abstracts/search?q=Fei%20Xing"> Fei Xing</a>, <a href="https://publications.waset.org/abstracts/search?q=Ye%20Lu"> Ye Lu</a>, <a href="https://publications.waset.org/abstracts/search?q=Jun%20Li%20Fang"> Jun Li Fang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> NDN is a kind of future Internet architecture. Due to the NDN design introduces four privacy challenges,Many research institutions began to care about the privacy issues of naming data network(NDN).In this paper, we are in view of the major NDN’s privacy issues to investigate privacy protection,then put forwards more effectively anonymous transfer policy for NDN.Firstly,based on mutual anonymity communication for MP2P networks,we propose NDN mutual anonymity protocol.Secondly,we add interest package authentication mechanism in the protocol and encrypt the coding coefficient, security of this protocol is improved by this way.Finally, we proof the proposed anonymous transfer protocol security and anonymity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=NDN" title="NDN">NDN</a>, <a href="https://publications.waset.org/abstracts/search?q=mutual%20anonymity" title=" mutual anonymity"> mutual anonymity</a>, <a href="https://publications.waset.org/abstracts/search?q=anonymous%20routing" title=" anonymous routing"> anonymous routing</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20coding" title=" network coding"> network coding</a>, <a href="https://publications.waset.org/abstracts/search?q=authentication%20mechanism" title=" authentication mechanism"> authentication mechanism</a> </p> <a href="https://publications.waset.org/abstracts/28422/secure-network-coding-based-named-data-network-mutual-anonymity-transfer-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28422.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">451</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11334</span> Mutual Fund Anchoring Bias with its Parent Firm Performance: Evidence from Mutual Fund Industry of Pakistan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Tahir">Muhammad Tahir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Purpose The purpose of the study is to find anchoring bias behavior in mutual fund return with its parent firm performance in Pakistan. Research Methodology The paper used monthly returns of equity funds whose parent firm exist from 2011 to 2021, along with parent firm return. Proximity to 52-week highest return calculated by dividing fund return by parent firm 52-week highest return. Control variables are also taken and used pannel regression model to estimate our results. For robust results, we also used feasible generalize least square (FGLS) model. Findings The results showed that there exist anchoring biased in mutual fund return with its parent firm performance. The FGLS results reaffirms the same results as obtained from panner regression results. Proximity to 52-week highest Xc is significant in both models. Research Implication Since most of mutual funds has a parent firm, anchoring behavior biased found in mutual fund with its parent firm performance. Practical Implication Mutual fund investors in Pakistan invest in equity funds in which behavioral bias exist, although there might be better opportunity in market. Originality/Value Addition Our research is a pioneer study to investigate anchoring bias in mutual fund return with its parent firm performance. Research limitations Our sample is limited to only 23 equity funds, which has a parent firm and data was available from 2011 to 2021. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mutual%20fund" title="mutual fund">mutual fund</a>, <a href="https://publications.waset.org/abstracts/search?q=anchoring%20bias" title=" anchoring bias"> anchoring bias</a>, <a href="https://publications.waset.org/abstracts/search?q=52-week%20high%20return" title=" 52-week high return"> 52-week high return</a>, <a href="https://publications.waset.org/abstracts/search?q=proximity%20to%2052-week%20high" title=" proximity to 52-week high"> proximity to 52-week high</a>, <a href="https://publications.waset.org/abstracts/search?q=parent%20firm%20performance" title=" parent firm performance"> parent firm performance</a>, <a href="https://publications.waset.org/abstracts/search?q=pannel%20regression" title=" pannel regression"> pannel regression</a>, <a href="https://publications.waset.org/abstracts/search?q=FGLS" title=" FGLS"> FGLS</a> </p> <a href="https://publications.waset.org/abstracts/164836/mutual-fund-anchoring-bias-with-its-parent-firm-performance-evidence-from-mutual-fund-industry-of-pakistan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/164836.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">119</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11333</span> An Application-Driven Procedure for Optimal Signal Digitization of Automotive-Grade Ultrasonic Sensors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Shawki%20Elamir">Mohamed Shawki Elamir</a>, <a href="https://publications.waset.org/abstracts/search?q=Heinrich%20Gotzig"> Heinrich Gotzig</a>, <a href="https://publications.waset.org/abstracts/search?q=Raoul%20Zoellner"> Raoul Zoellner</a>, <a href="https://publications.waset.org/abstracts/search?q=Patrick%20Maeder"> Patrick Maeder</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, a methodology is presented for identifying the optimal digitization parameters for the analog signal of ultrasonic sensors. These digitization parameters are the resolution of the analog to digital conversion and the sampling rate. This is accomplished through the derivation of characteristic curves based on Fano inequality and the calculation of the mutual information content over a given dataset. The mutual information is calculated between the examples in the dataset and the corresponding variation in the feature that needs to be estimated. The optimal parameters are identified in a manner that ensures optimal estimation performance while preventing inefficiency in using unnecessarily powerful analog to digital converters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analog%20to%20digital%20conversion" title="analog to digital conversion">analog to digital conversion</a>, <a href="https://publications.waset.org/abstracts/search?q=digitization" title=" digitization"> digitization</a>, <a href="https://publications.waset.org/abstracts/search?q=sampling%20rate" title=" sampling rate"> sampling rate</a>, <a href="https://publications.waset.org/abstracts/search?q=ultrasonic" title=" ultrasonic"> ultrasonic</a> </p> <a href="https://publications.waset.org/abstracts/141040/an-application-driven-procedure-for-optimal-signal-digitization-of-automotive-grade-ultrasonic-sensors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141040.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">207</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11332</span> The Formation of Mutual Understanding in Conversation: An Embodied Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Haruo%20Okabayashi">Haruo Okabayashi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The mutual understanding in conversation is very important for human relations. This study investigates the mental function of the formation of mutual understanding between two people in conversation using the embodied approach. Forty people participated in this study. They are divided into pairs randomly. Four conversation situations between two (make/listen to fun or pleasant talk, make/listen to regrettable talk) are set for four minutes each, and the finger plethysmogram (200 Hz) of each participant is measured. As a result, the attractors of the participants who reported “I did not understand my partner” show the collapsed shape, which means the fluctuation of their rhythm is too small to match their partner’s rhythm, and their cross correlation is low. The autonomic balance of both persons tends to resonate during conversation, and both LLEs tend to resonate, too. In human history, in order for human beings as weak mammals to live, they may have been with others; that is, they have brought about resonating characteristics, which is called self-organization. However, the resonant feature sometimes collapses, depending on the lifestyle that the person was formed by himself after birth. It is difficult for people who do not have a lifestyle of mutual gaze to resonate their biological signal waves with others’. These people have features such as anxiety, fatigue, and confusion tendency. Mutual understanding is thought to be formed as a result of cooperation between the features of self-organization of the persons who are talking and the lifestyle indicated by mutual gaze. Such an entanglement phenomenon is called a nonlinear relation. By this research, it is found that the formation of mutual understanding is expressed by the rhythm of a biological signal showing a nonlinear relationship. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=embodied%20approach" title="embodied approach">embodied approach</a>, <a href="https://publications.waset.org/abstracts/search?q=finger%20plethysmogram" title=" finger plethysmogram"> finger plethysmogram</a>, <a href="https://publications.waset.org/abstracts/search?q=mutual%20understanding" title=" mutual understanding"> mutual understanding</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20phenomenon" title=" nonlinear phenomenon"> nonlinear phenomenon</a> </p> <a href="https://publications.waset.org/abstracts/59375/the-formation-of-mutual-understanding-in-conversation-an-embodied-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59375.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">266</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11331</span> Control of a Stewart Platform for Minimizing Impact Energy in Simulating Spacecraft Docking Operations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Leonardo%20Herrera">Leonardo Herrera</a>, <a href="https://publications.waset.org/abstracts/search?q=Shield%20B.%20Lin"> Shield B. Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Stephen%20J.%20Montgomery-Smith"> Stephen J. Montgomery-Smith</a>, <a href="https://publications.waset.org/abstracts/search?q=Ziraguen%20O.%20Williams"> Ziraguen O. Williams</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Three control algorithms: Proportional-Integral-Derivative, Linear-Quadratic-Gaussian, and Linear-Quadratic-Gaussian with the shift, were applied to the computer simulation of a one-directional dynamic model of a Stewart Platform. The goal was to compare the dynamic system responses under the three control algorithms and to minimize the impact energy when simulating spacecraft docking operations. Equations were derived for the control algorithms and the input and output of the feedback control system. Using MATLAB, Simulink diagrams were created to represent the three control schemes. A switch selector was used for the convenience of changing among different controllers. The simulation demonstrated the controller using the algorithm of Linear-Quadratic-Gaussian with the shift resulting in the lowest impact energy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=controller" title="controller">controller</a>, <a href="https://publications.waset.org/abstracts/search?q=Stewart%20platform" title=" Stewart platform"> Stewart platform</a>, <a href="https://publications.waset.org/abstracts/search?q=docking%20operation" title=" docking operation"> docking operation</a>, <a href="https://publications.waset.org/abstracts/search?q=spacecraft" title=" spacecraft"> spacecraft</a> </p> <a href="https://publications.waset.org/abstracts/185802/control-of-a-stewart-platform-for-minimizing-impact-energy-in-simulating-spacecraft-docking-operations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/185802.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">51</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11330</span> Information Theoretic Approach for Beamforming in Wireless Communications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Syed%20Khurram%20Mahmud">Syed Khurram Mahmud</a>, <a href="https://publications.waset.org/abstracts/search?q=Athar%20Naveed"> Athar Naveed</a>, <a href="https://publications.waset.org/abstracts/search?q=Shoaib%20Arif"> Shoaib Arif</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Beamforming is a signal processing technique extensively utilized in wireless communications and radars for desired signal intensification and interference signal minimization through spatial selectivity. In this paper, we present a method for calculation of optimal weight vectors for smart antenna array, to achieve a directive pattern during transmission and selective reception in interference prone environment. In proposed scheme, Mutual Information (MI) extrema are evaluated through an energy constrained objective function, which is based on a-priori information of interference source and desired array factor. Signal to Interference plus Noise Ratio (SINR) performance is evaluated for both transmission and reception. In our scheme, MI is presented as an index to identify trade-off between information gain, SINR, illumination time and spatial selectivity in an energy constrained optimization problem. The employed method yields lesser computational complexity, which is presented through comparative analysis with conventional methods in vogue. MI based beamforming offers enhancement of signal integrity in degraded environment while reducing computational intricacy and correlating key performance indicators. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=beamforming" title="beamforming">beamforming</a>, <a href="https://publications.waset.org/abstracts/search?q=interference" title=" interference"> interference</a>, <a href="https://publications.waset.org/abstracts/search?q=mutual%20information" title=" mutual information"> mutual information</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20communications" title=" wireless communications"> wireless communications</a> </p> <a href="https://publications.waset.org/abstracts/89513/information-theoretic-approach-for-beamforming-in-wireless-communications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89513.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">280</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information&page=378">378</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information&page=379">379</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>