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: Cayley permutation</title> <meta name="description" content="Search results for: Cayley permutation"> <meta name="keywords" content="Cayley permutation"> <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="Cayley permutation" 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="Cayley permutation"> <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> 39</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Cayley permutation</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">39</span> Undirected Endo-Cayley Digraphs of Cyclic Groups of Order Primes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chanon%20Promsakon">Chanon Promsakon</a>, <a href="https://publications.waset.org/abstracts/search?q=Sayan%20Panma"> Sayan Panma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let S be a finite semigroup, A a subset of S and f an endomorphism on S. The endo-Cayley digraph of a semigroup S corresponding to a connecting set A and an endomorphism f, denoted by endo − Cayf (S, A) is a digraph whose vertex set is S and a vertex u is adjacent to a vertex v if and only if v = f(u)a for some a ∈ A. A digraph D is called undirected if any edge uv in D, there exists an edge vu in D. We consider the undirectedness of an endo-Cayley of a cyclic group of order prime, Zp. In this work, we investigate conditions for connecting sets and endomorphisms to make endo-Cayley digraphs of cyclic groups of order primes be undirected. Moreover, we give some conditions for an undirected endo-Cayley of cycle group of any order. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=endo-Cayley%20graph" title="endo-Cayley graph">endo-Cayley graph</a>, <a href="https://publications.waset.org/abstracts/search?q=undirected%20digraphs" title=" undirected digraphs"> undirected digraphs</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclic%20groups" title=" cyclic groups"> cyclic groups</a>, <a href="https://publications.waset.org/abstracts/search?q=endomorphism" title=" endomorphism"> endomorphism</a> </p> <a href="https://publications.waset.org/abstracts/5030/undirected-endo-cayley-digraphs-of-cyclic-groups-of-order-primes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5030.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">350</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">38</span> Independence and Path Independence on Cayley Digraphs of Left Groups and Right Groups</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nuttawoot%20Nupo">Nuttawoot Nupo</a>, <a href="https://publications.waset.org/abstracts/search?q=Sayan%20Panma"> Sayan Panma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A semigroup S is said to be a left (right) zero semigroup if S satisfies the equation xy=x (xy=y) for all x,y in S. In addition, the semigroup S is called a left (right) group if S is isomorphic to the direct product of a group and a left (right) zero semigroup. The Cayley digraph Cay(S,A) of a semigroup S with a connection set A is defined to be a digraph with the vertex set S and the arc set E(Cay(S,A))={(x,xa) | x∈S, a∈A} where A is any subset of S. All sets in this research are assumed to be finite. Let D be a digraph together with a vertex set V and an arc set E. Let u and v be two different vertices in V and I a nonempty subset of V. The vertices u and v are said to be independent if (u,v)∉E and (v,u)∉E. The set I is called an independent set of D if any two different vertices in I are independent. The independence number of D is the maximum cardinality of an independent set of D. Moreover, the vertices u and v are said to be path independent if there is no dipath from u to v and there is no dipath from v to u. The set I is called a path independent set of D if any two different vertices in I are path independent. The path independence number of D is the maximum cardinality of a path independent set of D. In this research, we describe a lower bound and an upper bound of the independence number of Cayley digraphs of left groups and right groups. Some examples corresponding to those bounds are illustrated here. Furthermore, the exact value of the path independence number of Cayley digraphs of left groups and right groups are also presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cayley%20digraphs" title="Cayley digraphs">Cayley digraphs</a>, <a href="https://publications.waset.org/abstracts/search?q=independence%20number" title=" independence number"> independence number</a>, <a href="https://publications.waset.org/abstracts/search?q=left%20groups" title=" left groups"> left groups</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20independence%20number" title=" path independence number"> path independence number</a>, <a href="https://publications.waset.org/abstracts/search?q=right%20groups" title=" right groups"> right groups</a> </p> <a href="https://publications.waset.org/abstracts/59306/independence-and-path-independence-on-cayley-digraphs-of-left-groups-and-right-groups" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59306.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">233</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">37</span> Linear Codes Afforded by the Permutation Representations of Finite Simple Groups and Their Support Designs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amin%20Saeidi">Amin Saeidi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Using a representation-theoretic approach and considering G to be a finite primitive permutation group of degree n, our aim is to determine linear codes of length n that admit G as a permutation automorphism group. We can show that in some cases, every binary linear code admitting G as a permutation automorphism group is a submodule of a permutation module defined by a primitive action of G. As an illustration of the method, we consider the sporadic simple group M₁₁ and the unitary group U(3,3). We also construct some point- and block-primitive 1-designs from the supports of some codewords of the codes in the discussion. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=linear%20code" title="linear code">linear code</a>, <a href="https://publications.waset.org/abstracts/search?q=permutation%20representation" title=" permutation representation"> permutation representation</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20design" title=" support design"> support design</a>, <a href="https://publications.waset.org/abstracts/search?q=simple%20group" title=" simple group"> simple group</a> </p> <a href="https://publications.waset.org/abstracts/174007/linear-codes-afforded-by-the-permutation-representations-of-finite-simple-groups-and-their-support-designs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/174007.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">77</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">36</span> A Genetic Algorithm Based Permutation and Non-Permutation Scheduling Heuristics for Finite Capacity Material Requirement Planning Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Watchara%20Songserm">Watchara Songserm</a>, <a href="https://publications.waset.org/abstracts/search?q=Teeradej%20Wuttipornpun"> Teeradej Wuttipornpun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a genetic algorithm based permutation and non-permutation scheduling heuristics (GAPNP) to solve a multi-stage finite capacity material requirement planning (FCMRP) problem in automotive assembly flow shop with unrelated parallel machines. In the algorithm, the sequences of orders are iteratively improved by the GA characteristics, whereas the required operations are scheduled based on the presented permutation and non-permutation heuristics. Finally, a linear programming is applied to minimize the total cost. The presented GAPNP algorithm is evaluated by using real datasets from automotive companies. The required parameters for GAPNP are intently tuned to obtain a common parameter setting for all case studies. The results show that GAPNP significantly outperforms the benchmark algorithm about 30% on average. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=capacitated%20MRP" title="capacitated MRP">capacitated MRP</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=linear%20programming" title=" linear programming"> linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=automotive%20industries" title=" automotive industries"> automotive industries</a>, <a href="https://publications.waset.org/abstracts/search?q=flow%20shop" title=" flow shop"> flow shop</a>, <a href="https://publications.waset.org/abstracts/search?q=application%20in%20industry" title=" application in industry"> application in industry</a> </p> <a href="https://publications.waset.org/abstracts/67589/a-genetic-algorithm-based-permutation-and-non-permutation-scheduling-heuristics-for-finite-capacity-material-requirement-planning-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67589.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">490</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">35</span> A Simple Recursive Framework to Generate Gray Codes for Weak Orders in Constant Amortized Time </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marsden%20Jacques">Marsden Jacques</a>, <a href="https://publications.waset.org/abstracts/search?q=Dennis%20Wong"> Dennis Wong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A weak order is a way to rank n objects where ties are allowed. In this talk, we present a recursive framework to generate Gray codes for weak orders. We then describe a simple algorithm based on the framework that generates 2-Gray codes for weak orders in constant amortized time per string. This framework can easily be modified to generate other Gray codes for weak orders. We provide an example on using the framework to generate the first Shift Gray code for weak orders, also in constant amortized time, where consecutive strings differ by a shift or a symbol change. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=weak%20order" title="weak order">weak order</a>, <a href="https://publications.waset.org/abstracts/search?q=Cayley%20permutation" title=" Cayley permutation"> Cayley permutation</a>, <a href="https://publications.waset.org/abstracts/search?q=Gray%20code" title=" Gray code"> Gray code</a>, <a href="https://publications.waset.org/abstracts/search?q=shift%20Gray%20code" title=" shift Gray code"> shift Gray code</a> </p> <a href="https://publications.waset.org/abstracts/118752/a-simple-recursive-framework-to-generate-gray-codes-for-weak-orders-in-constant-amortized-time" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118752.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">178</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">34</span> The Permutation of Symmetric Triangular Equilateral Group in the Cryptography of Private and Public Key</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fola%20John%20Adeyeye">Fola John Adeyeye</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a cryptosystem private and public key base on symmetric group Pn and validates its theoretical formulation. This proposed system benefits from the algebraic properties of Pn such as noncommutative high logical, computational speed and high flexibility in selecting key which makes the discrete permutation multiplier logic (DPML) resist to attack by any algorithm such as Pohlig-Hellman. One of the advantages of this scheme is that it explore all the possible triangular symmetries. Against these properties, the only disadvantage is that the law of permutation multiplicity only allow an operation from left to right. Many other cryptosystems can be transformed into their symmetric group. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptosystem" title="cryptosystem">cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=private%20and%20public%20key" title=" private and public key"> private and public key</a>, <a href="https://publications.waset.org/abstracts/search?q=DPML" title=" DPML"> DPML</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20group%20Pn" title=" symmetric group Pn"> symmetric group Pn</a> </p> <a href="https://publications.waset.org/abstracts/103766/the-permutation-of-symmetric-triangular-equilateral-group-in-the-cryptography-of-private-and-public-key" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103766.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">202</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">33</span> Automatic Seizure Detection Using Weighted Permutation Entropy and Support Vector Machine</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Noha%20Seddik">Noha Seddik</a>, <a href="https://publications.waset.org/abstracts/search?q=Sherine%20Youssef"> Sherine Youssef</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Kholeif"> Mohamed Kholeif</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The automated epileptic seizure detection research field has emerged in the recent years; this involves analyzing the Electroencephalogram (EEG) signals instead of the traditional visual inspection performed by expert neurologists. In this study, a Support Vector Machine (SVM) that uses Weighted Permutation Entropy (WPE) as the input feature is proposed for classifying normal and seizure EEG records. WPE is a modified statistical parameter of the permutation entropy (PE) that measures the complexity and irregularity of a time series. It incorporates both the mapped ordinal pattern of the time series and the information contained in the amplitude of its sample points. The proposed system utilizes the fact that entropy based measures for the EEG segments during epileptic seizure are lower than in normal EEG. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electroencephalogram%20%28EEG%29" title="electroencephalogram (EEG)">electroencephalogram (EEG)</a>, <a href="https://publications.waset.org/abstracts/search?q=epileptic%20seizure%20detection" title=" epileptic seizure detection"> epileptic seizure detection</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20permutation%20entropy%20%28WPE%29" title=" weighted permutation entropy (WPE)"> weighted permutation entropy (WPE)</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20vector%20machine%20%28SVM%29" title=" support vector machine (SVM)"> support vector machine (SVM)</a> </p> <a href="https://publications.waset.org/abstracts/12444/automatic-seizure-detection-using-weighted-permutation-entropy-and-support-vector-machine" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12444.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">372</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">32</span> Search for APN Permutations in Rings ℤ_2×ℤ_2^k</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Panario">Daniel Panario</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Santana%20de%20Freitas"> Daniel Santana de Freitas</a>, <a href="https://publications.waset.org/abstracts/search?q=Brett%20Stevens"> Brett Stevens</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Almost Perfect Nonlinear (APN) permutations with optimal resistance against differential cryptanalysis can be found in several domains. The permutation used in the standard for symmetric cryptography (the AES), for example, is based on a special kind of inversion in GF(28). Although very close to APN (2-uniform), this permutation still contains one number 4 in its differential spectrum, which means that, rigorously, it must be classified as 4-uniform. This fact motivates the search for fully APN permutations in other domains of definition. The extremely high complexity associated to this kind of problem precludes an exhaustive search for an APN permutation with 256 elements to be performed without the support of a suitable mathematical structure. On the other hand, in principle, there is nothing to indicate which mathematically structured domains can effectively help the search, and it is necessary to test several domains. In this work, the search for APN permutations in rings ℤ2×ℤ2k is investigated. After a full, exhaustive search with k=2 and k=3, all possible APN permutations in those rings were recorded, together with their differential profiles. Some very promising heuristics in these cases were collected so that, when used as a basis to prune backtracking for the same search in ℤ2×ℤ8 (search space with size 16! ≅244), just a few tenths of a second were enough to produce an APN permutation in a single CPU. Those heuristics were empirically extrapolated so that they could be applied to a backtracking search for APNs over ℤ2×ℤ16 (search space with size 32! ≅2117). The best permutations found in this search were further refined through Simulated Annealing, with a definition of neighbors suitable to this domain. The best result produced with this scheme was a 3-uniform permutation over ℤ2×ℤ16 with only 24 values equal to 3 in the differential spectrum (all the other 968 values were less than or equal 2, as it should be the case for an APN permutation). Although far from being fully APN, this result is technically better than a 4-uniform permutation and demanded only a few seconds in a single CPU. This is a strong indication that the use of mathematically structured domains, like the rings described in this work, together with heuristics based on smaller cases, can lead to dramatic cuts in the computational resources involved in the complexity of the search for APN permutations in extremely large domains. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=APN%20permutations" title="APN permutations">APN permutations</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20searches" title=" heuristic searches"> heuristic searches</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20cryptography" title=" symmetric cryptography"> symmetric cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=S-box%20design" title=" S-box design"> S-box design</a> </p> <a href="https://publications.waset.org/abstracts/145556/search-for-apn-permutations-in-rings-2-2k" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/145556.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">159</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">31</span> An Efficient Separation for Convolutive Mixtures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salah%20Al-Din%20I.%20Badran">Salah Al-Din I. Badran</a>, <a href="https://publications.waset.org/abstracts/search?q=Samad%20Ahmadi"> Samad Ahmadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Dylan%20Menzies"> Dylan Menzies</a>, <a href="https://publications.waset.org/abstracts/search?q=Ismail%20Shahin"> Ismail Shahin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes a new efficient blind source separation method; in this method we use a non-uniform filter bank and a new structure with different sub-bands. This method provides a reduced permutation and increased convergence speed comparing to the full-band algorithm. Recently, some structures have been suggested to deal with two problems: reducing permutation and increasing the speed of convergence of the adaptive algorithm for correlated input signals. The permutation problem is avoided with the use of adaptive filters of orders less than the full-band adaptive filter, which operate at a sampling rate lower than the sampling rate of the input signal. The decomposed signals by analysis bank filter are less correlated in each sub-band than the input signal at full-band, and can promote better rates of convergence. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Blind%20source%20separation" title="Blind source separation">Blind source separation</a>, <a href="https://publications.waset.org/abstracts/search?q=estimates" title=" estimates"> estimates</a>, <a href="https://publications.waset.org/abstracts/search?q=full-band" title=" full-band"> full-band</a>, <a href="https://publications.waset.org/abstracts/search?q=mixtures" title=" mixtures"> mixtures</a>, <a href="https://publications.waset.org/abstracts/search?q=sub-band" title=" sub-band"> sub-band</a> </p> <a href="https://publications.waset.org/abstracts/8254/an-efficient-separation-for-convolutive-mixtures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8254.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">445</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">30</span> Electroencephalography (EEG) Analysis of Alcoholic and Control Subjects Using Multiscale Permutation Entropy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lal%20Hussain">Lal Hussain</a>, <a href="https://publications.waset.org/abstracts/search?q=Wajid%20Aziz"> Wajid Aziz</a>, <a href="https://publications.waset.org/abstracts/search?q=Sajjad%20Ahmed%20Nadeem"> Sajjad Ahmed Nadeem</a>, <a href="https://publications.waset.org/abstracts/search?q=Saeed%20Arif%20Shah"> Saeed Arif Shah</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdul%20Majid"> Abdul Majid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Brain electrical activity as reflected in Electroencephalography (EEG) have been analyzed and diagnosed using various techniques. Among them, complexity measure, nonlinearity, disorder, and unpredictability play vital role due to the nonlinear interconnection between functional and anatomical subsystem emerged in brain in healthy state and during various diseases. There are many social and economical issues of alcoholic abuse as memory weakness, decision making, impairments, and concentrations etc. Alcoholism not only defect the brains but also associated with emotional, behavior, and cognitive impairments damaging the white and gray brain matters. A recently developed signal analysis method i.e. Multiscale Permutation Entropy (MPE) is proposed to estimate the complexity of long-range temporal correlation time series EEG of Alcoholic and Control subjects acquired from University of California Machine Learning repository and results are compared with MSE. Using MPE, coarsed grained series is first generated and the PE is computed for each coarsed grained time series against the electrodes O1, O2, C3, C4, F2, F3, F4, F7, F8, Fp1, Fp2, P3, P4, T7, and T8. The results computed against each electrode using MPE gives higher significant values as compared to MSE as well as mean rank differences accordingly. Likewise, ROC and Area under the ROC also gives higher separation against each electrode using MPE in comparison to MSE. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electroencephalogram%20%28EEG%29" title="electroencephalogram (EEG)">electroencephalogram (EEG)</a>, <a href="https://publications.waset.org/abstracts/search?q=multiscale%20permutation%20entropy%20%28MPE%29" title=" multiscale permutation entropy (MPE)"> multiscale permutation entropy (MPE)</a>, <a href="https://publications.waset.org/abstracts/search?q=multiscale%20sample%20entropy%20%28MSE%29" title=" multiscale sample entropy (MSE)"> multiscale sample entropy (MSE)</a>, <a href="https://publications.waset.org/abstracts/search?q=permutation%20entropy%20%28PE%29" title=" permutation entropy (PE)"> permutation entropy (PE)</a>, <a href="https://publications.waset.org/abstracts/search?q=mann%20whitney%20test%20%28MMT%29" title=" mann whitney test (MMT)"> mann whitney test (MMT)</a>, <a href="https://publications.waset.org/abstracts/search?q=receiver%20operator%20curve%20%28ROC%29" title=" receiver operator curve (ROC)"> receiver operator curve (ROC)</a>, <a href="https://publications.waset.org/abstracts/search?q=complexity%20measure" title=" complexity measure"> complexity measure</a> </p> <a href="https://publications.waset.org/abstracts/21664/electroencephalography-eeg-analysis-of-alcoholic-and-control-subjects-using-multiscale-permutation-entropy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21664.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">495</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">29</span> A General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=G.%20M.%20Komaki">G. M. Komaki</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Mobin"> S. Mobin</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Teymourian"> E. Teymourian</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Sheikh"> S. Sheikh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper addresses minimizing the makespan of the distributed permutation flow shop scheduling problem. In this problem, there are several parallel identical factories or flowshops each with series of similar machines. Each job should be allocated to one of the factories and all of the operations of the jobs should be performed in the allocated factory. This problem has recently gained attention and due to NP-Hard nature of the problem, metaheuristic algorithms have been proposed to tackle it. Majority of the proposed algorithms require large computational time which is the main drawback. In this study, a general variable neighborhood search algorithm (GVNS) is proposed where several time-saving schemes have been incorporated into it. Also, the GVNS uses the sophisticated method to change the shaking procedure or perturbation depending on the progress of the incumbent solution to prevent stagnation of the search. The performance of the proposed algorithm is compared to the state-of-the-art algorithms based on standard benchmark instances. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20permutation%20flow%20shop" title="distributed permutation flow shop">distributed permutation flow shop</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a>, <a href="https://publications.waset.org/abstracts/search?q=general%20variable%20neighborhood%20search%20algorithm" title=" general variable neighborhood search algorithm"> general variable neighborhood search algorithm</a> </p> <a href="https://publications.waset.org/abstracts/37025/a-general-variable-neighborhood-search-algorithm-to-minimize-makespan-of-the-distributed-permutation-flowshop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37025.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">354</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">28</span> Mathematical Model That Using Scrambling and Message Integrity Methods in Audio Steganography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Salem%20Atoum">Mohammed Salem Atoum</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The success of audio steganography is to ensure imperceptibility of the embedded message in stego file and withstand any form of intentional or un-intentional degradation of message (robustness). Audio steganographic that utilized LSB of audio stream to embed message gain a lot of popularity over the years in meeting the perceptual transparency, robustness and capacity. This research proposes an XLSB technique in order to circumvent the weakness observed in LSB technique. Scrambling technique is introduce in two steps; partitioning the message into blocks followed by permutation each blocks in order to confuse the contents of the message. The message is embedded in the MP3 audio sample. After extracting the message, the permutation codebook is used to re-order it into its original form. Md5sum and SHA-256 are used to verify whether the message is altered or not during transmission. Experimental result shows that the XLSB performs better than LSB. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=XLSB" title="XLSB">XLSB</a>, <a href="https://publications.waset.org/abstracts/search?q=scrambling" title=" scrambling"> scrambling</a>, <a href="https://publications.waset.org/abstracts/search?q=audio%20steganography" title=" audio steganography"> audio steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a> </p> <a href="https://publications.waset.org/abstracts/42449/mathematical-model-that-using-scrambling-and-message-integrity-methods-in-audio-steganography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42449.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">363</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">27</span> A Heuristic Approach for the General Flowshop Scheduling Problem to Minimize the Makespan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Ziaee">Mohsen Ziaee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Almost all existing researches on the flowshop scheduling problems focus on the permutation schedules and there is insufficient study dedicated to the general flowshop scheduling problems in the literature, since the modeling and solving of the general flowshop scheduling problems are more difficult than the permutation ones, especially for the large-size problem instances. This paper considers the general flowshop scheduling problem with the objective function of the makespan (F//Cmax). We first find the optimal solution of the problem by solving a mixed integer linear programming model. An efficient heuristic method is then presented to solve the problem. An ant colony optimization algorithm is also proposed for the problem. In order to evaluate the performance of the methods, computational experiments are designed and performed. Numerical results show that the heuristic algorithm can result in reasonable solutions with low computational effort and even achieve optimal solutions in some cases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=scheduling" title="scheduling">scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=general%20flow%20shop%20scheduling%20problem" title=" general flow shop scheduling problem"> general flow shop scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic" title=" heuristic"> heuristic</a> </p> <a href="https://publications.waset.org/abstracts/92277/a-heuristic-approach-for-the-general-flowshop-scheduling-problem-to-minimize-the-makespan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92277.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">26</span> An Improved Ant Colony Algorithm for Genome Rearrangements</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Essam%20Al%20Daoud">Essam Al Daoud</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genome rearrangement is an important area in computational biology and bioinformatics. The basic problem in genome rearrangements is to compute the edit distance, i.e., the minimum number of operations needed to transform one genome into another. Unfortunately, unsigned genome rearrangement problem is NP-hard. In this study an improved ant colony optimization algorithm to approximate the edit distance is proposed. The main idea is to convert the unsigned permutation to signed permutation and evaluate the ants by using Kaplan algorithm. Two new operations are added to the standard ant colony algorithm: Replacing the worst ants by re-sampling the ants from a new probability distribution and applying the crossover operations on the best ants. The proposed algorithm is tested and compared with the improved breakpoint reversal sort algorithm by using three datasets. The results indicate that the proposed algorithm achieves better accuracy ratio than the previous methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20algorithm" title="ant colony algorithm">ant colony algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=edit%20distance" title=" edit distance"> edit distance</a>, <a href="https://publications.waset.org/abstracts/search?q=genome%0D%0Abreakpoint" title=" genome breakpoint"> genome breakpoint</a>, <a href="https://publications.waset.org/abstracts/search?q=genome%20rearrangement" title=" genome rearrangement"> genome rearrangement</a>, <a href="https://publications.waset.org/abstracts/search?q=reversal%20sort" title=" reversal sort"> reversal sort</a> </p> <a href="https://publications.waset.org/abstracts/5601/an-improved-ant-colony-algorithm-for-genome-rearrangements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5601.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">344</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">25</span> A Parallel Algorithm for Solving the PFSP on the Grid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samia%20Kouki">Samia Kouki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Solving NP-hard combinatorial optimization problems by exact search methods, such as Branch-and-Bound, may degenerate to complete enumeration. For that reason, exact approaches limit us to solve only small or moderate size problem instances, due to the exponential increase in CPU time when problem size increases. One of the most promising ways to reduce significantly the computational burden of sequential versions of Branch-and-Bound is to design parallel versions of these algorithms which employ several processors. This paper describes a parallel Branch-and-Bound algorithm called GALB for solving the classical permutation flowshop scheduling problem as well as its implementation on a Grid computing infrastructure. The experimental study of our distributed parallel algorithm gives promising results and shows clearly the benefit of the parallel paradigm to solve large-scale instances in moderate CPU time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=grid%20computing" title="grid computing">grid computing</a>, <a href="https://publications.waset.org/abstracts/search?q=permutation%20flow%20shop%20problem" title=" permutation flow shop problem"> permutation flow shop problem</a>, <a href="https://publications.waset.org/abstracts/search?q=branch%20and%20bound" title=" branch and bound"> branch and bound</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a> </p> <a href="https://publications.waset.org/abstracts/47518/a-parallel-algorithm-for-solving-the-pfsp-on-the-grid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47518.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">283</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">24</span> Modification Encryption Time and Permutation in Advanced Encryption Standard Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dalal%20N.%20Hammod">Dalal N. Hammod</a>, <a href="https://publications.waset.org/abstracts/search?q=Ekhlas%20K.%20Gbashi"> Ekhlas K. Gbashi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, cryptography is used in many applications to achieve high security in data transmission and in real-time communications. AES has long gained global acceptance and is used for securing sensitive data in various industries but has suffered from slow processing and take a large time to transfer data. This paper suggests a method to enhance Advance Encryption Standard (AES) Algorithm based on time and permutation. The suggested method (MAES) is based on modifying the SubByte and ShiftRrows in the encryption part and modification the InvSubByte and InvShiftRows in the decryption part. After the implementation of the proposal and testing the results, the Modified AES achieved good results in accomplishing the communication with high performance criteria in terms of randomness, encryption time, storage space, and avalanche effects. The proposed method has good randomness to ciphertext because this method passed NIST statistical tests against attacks; also, (MAES) reduced the encryption time by (10 %) than the time of the original AES; therefore, the modified AES is faster than the original AES. Also, the proposed method showed good results in memory utilization where the value is (54.36) for the MAES, but the value for the original AES is (66.23). Also, the avalanche effects used for calculating diffusion property are (52.08%) for the modified AES and (51.82%) percentage for the original AES. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=modified%20AES" title="modified AES">modified AES</a>, <a href="https://publications.waset.org/abstracts/search?q=randomness%20test" title=" randomness test"> randomness test</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption%20time" title=" encryption time"> encryption time</a>, <a href="https://publications.waset.org/abstracts/search?q=avalanche%20effects" title=" avalanche effects"> avalanche effects</a> </p> <a href="https://publications.waset.org/abstracts/139308/modification-encryption-time-and-permutation-in-advanced-encryption-standard-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/139308.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">23</span> BeamGA Median: A Hybrid Heuristic Search Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ghada%20Badr">Ghada Badr</a>, <a href="https://publications.waset.org/abstracts/search?q=Manar%20Hosny"> Manar Hosny</a>, <a href="https://publications.waset.org/abstracts/search?q=Nuha%20Bintayyash"> Nuha Bintayyash</a>, <a href="https://publications.waset.org/abstracts/search?q=Eman%20Albilali"> Eman Albilali</a>, <a href="https://publications.waset.org/abstracts/search?q=Souad%20Larabi%20Marie-Sainte"> Souad Larabi Marie-Sainte</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The median problem is significantly applied to derive the most reasonable rearrangement phylogenetic tree for many species. More specifically, the problem is concerned with finding a permutation that minimizes the sum of distances between itself and a set of three signed permutations. Genomes with equal number of genes but different order can be represented as permutations. In this paper, an algorithm, namely BeamGA median, is proposed that combines a heuristic search approach (local beam) as an initialization step to generate a number of solutions, and then a Genetic Algorithm (GA) is applied in order to refine the solutions, aiming to achieve a better median with the smallest possible reversal distance from the three original permutations. In this approach, any genome rearrangement distance can be applied. In this paper, we use the reversal distance. To the best of our knowledge, the proposed approach was not applied before for solving the median problem. Our approach considers true biological evolution scenario by applying the concept of common intervals during the GA optimization process. This allows us to imitate a true biological behavior and enhance genetic approach time convergence. We were able to handle permutations with a large number of genes, within an acceptable time performance and with same or better accuracy as compared to existing algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=median%20problem" title="median problem">median problem</a>, <a href="https://publications.waset.org/abstracts/search?q=phylogenetic%20tree" title=" phylogenetic tree"> phylogenetic tree</a>, <a href="https://publications.waset.org/abstracts/search?q=permutation" title=" permutation"> permutation</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=beam%20search" title=" beam search"> beam search</a>, <a href="https://publications.waset.org/abstracts/search?q=genome%20rearrangement%20distance" title=" genome rearrangement distance"> genome rearrangement distance</a> </p> <a href="https://publications.waset.org/abstracts/73026/beamga-median-a-hybrid-heuristic-search-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73026.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">265</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">22</span> A Study on Weddernburn – Artin Theorem for Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fahad%20Suleiman">Fahad Suleiman</a>, <a href="https://publications.waset.org/abstracts/search?q=Sammani%20Abdullahi"> Sammani Abdullahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study depicts that a Wedderburn Artin – theorem for rings is considered to be a semisimple ring R which is isomorphic to a product of finitely many mi by mi matrix rings over division rings Di, for some integers n_i, both of which are uniquely determined up to permutation of the index i. It has been concluded that when R is simple the Wedderburn – Artin theorem is known as Wedderburn’s theorem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Commutativity" title="Commutativity">Commutativity</a>, <a href="https://publications.waset.org/abstracts/search?q=Wedderburn%20theorem" title=" Wedderburn theorem"> Wedderburn theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=Semisimple%20ring" title=" Semisimple ring"> Semisimple ring</a>, <a href="https://publications.waset.org/abstracts/search?q=R%20module" title=" R module"> R module</a> </p> <a href="https://publications.waset.org/abstracts/115025/a-study-on-weddernburn-artin-theorem-for-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/115025.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">164</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">21</span> Performance Analysis of Next Generation OCDM-RoF-Based Hybrid Network under Diverse Conditions </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anurag%20Sharma">Anurag Sharma</a>, <a href="https://publications.waset.org/abstracts/search?q=Rahul%20Malhotra"> Rahul Malhotra</a>, <a href="https://publications.waset.org/abstracts/search?q=Love%20Kumar"> Love Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Harjit%20Pal%20Singh"> Harjit Pal Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper demonstrates OCDM-ROF based hybrid architecture where data/voice communication is enabled via a permutation of Optical Code Division Multiplexing (OCDM) and Radio-over-Fiber (RoF) techniques under various diverse conditions. OCDM-RoF hybrid network of 16 users with DPSK modulation format has been designed and performance of proposed network is analyzed for 100, 150, and 200 km fiber span length under the influence of linear and nonlinear effect. It has been reported that Polarization Mode Dispersion (PMD) has the least effect while other nonlinearity affects the performance of proposed network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=OCDM" title="OCDM">OCDM</a>, <a href="https://publications.waset.org/abstracts/search?q=RoF" title=" RoF"> RoF</a>, <a href="https://publications.waset.org/abstracts/search?q=DPSK" title=" DPSK"> DPSK</a>, <a href="https://publications.waset.org/abstracts/search?q=PMD" title=" PMD"> PMD</a>, <a href="https://publications.waset.org/abstracts/search?q=eye%20diagram" title=" eye diagram"> eye diagram</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a>, <a href="https://publications.waset.org/abstracts/search?q=Q%20factor" title=" Q factor"> Q factor</a> </p> <a href="https://publications.waset.org/abstracts/16352/performance-analysis-of-next-generation-ocdm-rof-based-hybrid-network-under-diverse-conditions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16352.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">638</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">20</span> Applying Sequential Pattern Mining to Generate Block for Scheduling Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Meng-Hui%20Chen">Meng-Hui Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Chen-Yu%20Kao"> Chen-Yu Kao</a>, <a href="https://publications.waset.org/abstracts/search?q=Chia-Yu%20Hsu"> Chia-Yu Hsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Pei-Chann%20Chang"> Pei-Chann Chang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main idea in this paper is using sequential pattern mining to find the information which is helpful for finding high performance solutions. By combining this information, it is defined as blocks. Using the blocks to generate artificial chromosomes (ACs) could improve the structure of solutions. Estimation of Distribution Algorithms (EDAs) is adapted to solve the combinatorial problems. Nevertheless many of these approaches are advantageous for this application, but only some of them are used to enhance the efficiency of application. Generating ACs uses patterns and EDAs could increase the diversity. According to the experimental result, the algorithm which we proposed has a better performance to solve the permutation flow-shop problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20problems" title="combinatorial problems">combinatorial problems</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20pattern%20mining" title=" sequential pattern mining"> sequential pattern mining</a>, <a href="https://publications.waset.org/abstracts/search?q=estimationof%20distribution%20algorithms" title=" estimationof distribution algorithms"> estimationof distribution algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20chromosomes" title=" artificial chromosomes"> artificial chromosomes</a> </p> <a href="https://publications.waset.org/abstracts/10391/applying-sequential-pattern-mining-to-generate-block-for-scheduling-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10391.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">611</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">19</span> Two-Stage Approach for Solving the Multi-Objective Optimization Problem on Combinatorial Configurations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Liudmyla%20Koliechkina">Liudmyla Koliechkina</a>, <a href="https://publications.waset.org/abstracts/search?q=Olena%20Dvirna"> Olena Dvirna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The statement of the multi-objective optimization problem on combinatorial configurations is formulated, and the approach to its solution is proposed. The problem is of interest as a combinatorial optimization one with many criteria, which is a model of many applied tasks. The approach to solving the multi-objective optimization problem on combinatorial configurations consists of two stages; the first is the reduction of the multi-objective problem to the single criterion based on existing multi-objective optimization methods, the second stage solves the directly replaced single criterion combinatorial optimization problem by the horizontal combinatorial method. This approach provides the optimal solution to the multi-objective optimization problem on combinatorial configurations, taking into account additional restrictions for a finite number of steps. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20set" title="discrete set">discrete set</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20combinatorial%20optimization" title=" linear combinatorial optimization"> linear combinatorial optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Pareto%20solutions" title=" Pareto solutions"> Pareto solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20permutation%20set" title=" partial permutation set"> partial permutation set</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20graph" title=" structural graph"> structural graph</a> </p> <a href="https://publications.waset.org/abstracts/133824/two-stage-approach-for-solving-the-multi-objective-optimization-problem-on-combinatorial-configurations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133824.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">167</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">18</span> Attention Multiple Instance Learning for Cancer Tissue Classification in Digital Histopathology Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Afaf%20Alharbi">Afaf Alharbi</a>, <a href="https://publications.waset.org/abstracts/search?q=Qianni%20Zhang"> Qianni Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The identification of malignant tissue in histopathological slides holds significant importance in both clinical settings and pathology research. This paper introduces a methodology aimed at automatically categorizing cancerous tissue through the utilization of a multiple-instance learning framework. This framework is specifically developed to acquire knowledge of the Bernoulli distribution of the bag label probability by employing neural networks. Furthermore, we put forward a neural network based permutation-invariant aggregation operator, equivalent to attention mechanisms, which is applied to the multi-instance learning network. Through empirical evaluation of an openly available colon cancer histopathology dataset, we provide evidence that our approach surpasses various conventional deep learning methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=attention%20multiple%20instance%20learning" title="attention multiple instance learning">attention multiple instance learning</a>, <a href="https://publications.waset.org/abstracts/search?q=MIL%20and%20transfer%20learning" title=" MIL and transfer learning"> MIL and transfer learning</a>, <a href="https://publications.waset.org/abstracts/search?q=histopathological%20slides" title=" histopathological slides"> histopathological slides</a>, <a href="https://publications.waset.org/abstracts/search?q=cancer%20tissue%20classification" title=" cancer tissue classification"> cancer tissue classification</a> </p> <a href="https://publications.waset.org/abstracts/167708/attention-multiple-instance-learning-for-cancer-tissue-classification-in-digital-histopathology-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167708.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">110</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">17</span> A Comparison of Methods for Estimating Dichotomous Treatment Effects: A Simulation Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jacqueline%20Y.%20Thompson">Jacqueline Y. Thompson</a>, <a href="https://publications.waset.org/abstracts/search?q=Sam%20Watson"> Sam Watson</a>, <a href="https://publications.waset.org/abstracts/search?q=Lee%20Middleton"> Lee Middleton</a>, <a href="https://publications.waset.org/abstracts/search?q=Karla%20Hemming"> Karla Hemming</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Introduction: The odds ratio (estimated via logistic regression) is a well-established and common approach for estimating covariate-adjusted binary treatment effects when comparing a treatment and control group with dichotomous outcomes. Its popularity is primarily because of its stability and robustness to model misspecification. However, the situation is different for the relative risk and risk difference, which are arguably easier to interpret and better suited to specific designs such as non-inferiority studies. So far, there is no equivalent, widely acceptable approach to estimate an adjusted relative risk and risk difference when conducting clinical trials. This is partly due to the lack of a comprehensive evaluation of available candidate methods. Methods/Approach: A simulation study is designed to evaluate the performance of relevant candidate methods to estimate relative risks to represent conditional and marginal estimation approaches. We consider the log-binomial, generalised linear models (GLM) with iteratively weighted least-squares (IWLS) and model-based standard errors (SE); log-binomial GLM with convex optimisation and model-based SEs; log-binomial GLM with convex optimisation and permutation tests; modified-Poisson GLM IWLS and robust SEs; log-binomial generalised estimation equations (GEE) and robust SEs; marginal standardisation and delta method SEs; and marginal standardisation and permutation test SEs. Independent and identically distributed datasets are simulated from a randomised controlled trial to evaluate these candidate methods. Simulations are replicated 10000 times for each scenario across all possible combinations of sample sizes (200, 1000, and 5000), outcomes (10%, 50%, and 80%), and covariates (ranging from -0.05 to 0.7) representing weak, moderate or strong relationships. Treatment effects (ranging from 0, -0.5, 1; on the log-scale) will consider null (H0) and alternative (H1) hypotheses to evaluate coverage and power in realistic scenarios. Performance measures (bias, mean square error (MSE), relative efficiency, and convergence rates) are evaluated across scenarios covering a range of sample sizes, event rates, covariate prognostic strength, and model misspecifications. Potential Results, Relevance & Impact: There are several methods for estimating unadjusted and adjusted relative risks. However, it is unclear which method(s) is the most efficient, preserves type-I error rate, is robust to model misspecification, or is the most powerful when adjusting for non-prognostic and prognostic covariates. GEE estimations may be biased when the outcome distributions are not from marginal binary data. Also, it seems that marginal standardisation and convex optimisation may perform better than GLM IWLS log-binomial. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20outcomes" title="binary outcomes">binary outcomes</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20methods" title=" statistical methods"> statistical methods</a>, <a href="https://publications.waset.org/abstracts/search?q=clinical%20trials" title=" clinical trials"> clinical trials</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation%20study" title=" simulation study"> simulation study</a> </p> <a href="https://publications.waset.org/abstracts/154314/a-comparison-of-methods-for-estimating-dichotomous-treatment-effects-a-simulation-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154314.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">114</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">16</span> Geared Turbofan with Water Alcohol Technology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abhinav%20Purohit">Abhinav Purohit</a>, <a href="https://publications.waset.org/abstracts/search?q=Shruthi%20S.%20Pradeep"> Shruthi S. Pradeep</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In today’s world, aviation industries are using turbofan engines (permutation of turboprop and turbojet) which meet the obligatory requirements to be fuel competent and to produce enough thrust to propel an aircraft. But one can imagine increasing the work output of this particular machine by reducing the input power. In striving to improve technologies, especially to augment the efficiency of the engine with some adaptations, which can be crooked to new concepts by introducing a step change in the turbofan engine development. One hopeful concept is, to de-couple the fan with the help of reduction gear box in a two spool shaft engine from the rest of the machinery to get more work output with maximum efficiency by reducing the load on the turbine shaft. By adapting this configuration we can get an additional degree of freedom to better optimize each component at different speeds. Since the components are running at different speeds we can get hold of preferable efficiency. Introducing water alcohol mixture to this concept would really help to get better results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=emissions" title="emissions">emissions</a>, <a href="https://publications.waset.org/abstracts/search?q=fuel%20consumption" title=" fuel consumption"> fuel consumption</a>, <a href="https://publications.waset.org/abstracts/search?q=more%20power" title=" more power"> more power</a>, <a href="https://publications.waset.org/abstracts/search?q=turbofan" title=" turbofan"> turbofan</a> </p> <a href="https://publications.waset.org/abstracts/2279/geared-turbofan-with-water-alcohol-technology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2279.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">435</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">15</span> Randomness in Cybertext: A Study on Computer-Generated Poetry from the Perspective of Semiotics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hongliang%20Zhang">Hongliang Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of chance procedures and randomizers in poetry-writing can be traced back to surrealist works, which, by appealing to Sigmund Freud's theories, were still logocentrism. In the 1960s, random permutation and combination were extensively used by the Oulipo, John Cage and Jackson Mac Low, which further deconstructed the metaphysical presence of writing. Today, the randomly-generated digital poetry has emerged as a genre of cybertext which should be co-authored by readers. At the same time, the classical theories have now been updated by cybernetics and media theories. N· Katherine Hayles put forward the concept of ‘the floating signifiers’ by Jacques Lacan to be the ‘the flickering signifiers’ , arguing that the technology per se has become a part of the textual production. This paper makes a historical review of the computer-generated poetry in the perspective of semiotics, emphasizing that the randomly-generated digital poetry which hands over the dual tasks of both interpretation and writing to the readers demonstrates the intervention of media technology in literature. With the participation of computerized algorithm and programming languages, poems randomly generated by computers have not only blurred the boundary between encoder and decoder, but also raises the issue of human-machine. It is also a significant feature of the cybertext that the productive process of the text is full of randomness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cybertext" title="cybertext">cybertext</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20poetry" title=" digital poetry"> digital poetry</a>, <a href="https://publications.waset.org/abstracts/search?q=poetry%20generator" title=" poetry generator"> poetry generator</a>, <a href="https://publications.waset.org/abstracts/search?q=semiotics" title=" semiotics"> semiotics</a> </p> <a href="https://publications.waset.org/abstracts/96100/randomness-in-cybertext-a-study-on-computer-generated-poetry-from-the-perspective-of-semiotics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96100.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">175</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">14</span> Statistical Randomness Testing of Some Second Round Candidate Algorithms of CAESAR Competition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fatih%20Sulak">Fatih Sulak</a>, <a href="https://publications.waset.org/abstracts/search?q=Bet%C3%BCl%20A.%20%C3%96zdemir"> Betül A. Özdemir</a>, <a href="https://publications.waset.org/abstracts/search?q=Beyza%20Bozdemir"> Beyza Bozdemir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to improve symmetric key research, several competitions had been arranged by organizations like National Institute of Standards and Technology (NIST) and International Association for Cryptologic Research (IACR). In recent years, the importance of authenticated encryption has rapidly increased because of the necessity of simultaneously enabling integrity, confidentiality and authenticity. Therefore, at January 2013, IACR announced the Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR Competition) which will select secure and efficient algorithms for authenticated encryption. Cryptographic algorithms are anticipated to behave like random mappings; hence, it is important to apply statistical randomness tests to the outputs of the algorithms. In this work, the statistical randomness tests in the NIST Test Suite and the other recently designed randomness tests are applied to six second round algorithms of the CAESAR Competition. It is observed that AEGIS achieves randomness after 3 rounds, Ascon permutation function achieves randomness after 1 round, Joltik encryption function achieves randomness after 9 rounds, Morus state update function achieves randomness after 3 rounds, Pi-cipher achieves randomness after 1 round, and Tiaoxin achieves randomness after 1 round. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=authenticated%20encryption" title="authenticated encryption">authenticated encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=CAESAR%20competition" title=" CAESAR competition"> CAESAR competition</a>, <a href="https://publications.waset.org/abstracts/search?q=NIST%20test%20suite" title=" NIST test suite"> NIST test suite</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20randomness%20tests" title=" statistical randomness tests"> statistical randomness tests</a> </p> <a href="https://publications.waset.org/abstracts/63254/statistical-randomness-testing-of-some-second-round-candidate-algorithms-of-caesar-competition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63254.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">315</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">13</span> Deciding Graph Non-Hamiltonicity via a Closure Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=E.%20R.%20Swart">E. R. Swart</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20J.%20Gismondi"> S. J. Gismondi</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20R.%20Swart"> N. R. Swart</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20E.%20Bell"> C. E. Bell</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present an heuristic algorithm that decides graph non-Hamiltonicity. All graphs are directed, each undirected edge regarded as a pair of counter directed arcs. Each of the n! Hamilton cycles in a complete graph on n+1 vertices is mapped to an n-permutation matrix P where p(u,i)=1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n+1. We first create exclusion set E by noting all arcs (u, v) not in G, sufficient to code precisely all cycles excluded from G i.e. cycles not in G use at least one arc not in G. Members are pairs of components of P, {p(u,i),p(v,i+1)}, i=1, n-1. A doubly stochastic-like relaxed LP formulation of the Hamilton cycle decision problem is constructed. Each {p(u,i),p(v,i+1)} in E is coded as variable q(u,i,v,i+1)=0 i.e. shrinks the feasible region. We then implement the Weak Closure Algorithm (WCA) that tests necessary conditions of a matching, together with Boolean closure to decide 0/1 variable assignments. Each {p(u,i),p(v,j)} not in E is tested for membership in E, and if possible, added to E (q(u,i,v,j)=0) to iteratively maximize |E|. If the WCA constructs E to be maximal, the set of all {p(u,i),p(v,j)}, then G is decided non-Hamiltonian. Only non-Hamiltonian G share this maximal property. Ten non-Hamiltonian graphs (10 through 104 vertices) and 2000 randomized 31 vertex non-Hamiltonian graphs are tested and correctly decided non-Hamiltonian. For Hamiltonian G, the complement of E covers a matching, perhaps useful in searching for cycles. We also present an example where the WCA fails. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hamilton%20cycle%20decision%20problem" title="Hamilton cycle decision problem">Hamilton cycle decision problem</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20complexity%20theory" title=" computational complexity theory"> computational complexity theory</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20theory" title=" graph theory"> graph theory</a>, <a href="https://publications.waset.org/abstracts/search?q=theoretical%20computer%20science" title=" theoretical computer science"> theoretical computer science</a> </p> <a href="https://publications.waset.org/abstracts/6023/deciding-graph-non-hamiltonicity-via-a-closure-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6023.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">373</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">12</span> Factor Study Affecting Visual Awareness on Dynamic Object Monitoring</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Terry%20Liang%20Khin%20Teo">Terry Liang Khin Teo</a>, <a href="https://publications.waset.org/abstracts/search?q=Sun%20Woh%20Lye"> Sun Woh Lye</a>, <a href="https://publications.waset.org/abstracts/search?q=Kai%20Lun%20Brendon%20Goh"> Kai Lun Brendon Goh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As applied to dynamic monitoring situations, the prevailing approach to situation awareness (SA) assumes that the relevant areas of interest (AOI) be perceived before that information can be processed further to affect decision-making and, thereafter, action. It is not entirely clear whether this is the case. This study seeks to investigate the monitoring of dynamic objects through matching eye fixations with the relevant AOIs in boundary-crossing scenarios. By this definition, a match is where a fixation is registered on the AOI. While many factors may affect monitoring characteristics, traffic simulations were designed in this study to explore two factors, namely: the number of inbounds/outbound traffic transfers and the number of entry and/or exit points in a radar monitoring sector. These two factors were graded into five levels of difficulty ranging from low to high traffic flow numbers. Combined permutation in terms of levels of difficulty of these two factors yielded a total of thirty scenarios. Through this, results showed that changes in the traffic flow numbers on transfer resulted in greater variations having match limits ranging from 29%-100%, as compared to the number of sector entry/exit points of range limit from 80%-100%. The subsequent analysis is able to determine the type and combination of traffic scenarios where imperfect matching is likely to occur. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=air%20traffic%20simulation" title="air traffic simulation">air traffic simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=eye-tracking" title=" eye-tracking"> eye-tracking</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20monitoring" title=" visual monitoring"> visual monitoring</a>, <a href="https://publications.waset.org/abstracts/search?q=focus%20attention" title=" focus attention"> focus attention</a> </p> <a href="https://publications.waset.org/abstracts/155140/factor-study-affecting-visual-awareness-on-dynamic-object-monitoring" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/155140.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">57</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">11</span> Tree-Based Inference for Regionalization: A Comparative Study of Global Topological Perturbation Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Orhun%20Aydin">Orhun Aydin</a>, <a href="https://publications.waset.org/abstracts/search?q=Mark%20V.%20Janikas"> Mark V. Janikas</a>, <a href="https://publications.waset.org/abstracts/search?q=Rodrigo%20Alves"> Rodrigo Alves</a>, <a href="https://publications.waset.org/abstracts/search?q=Renato%20Assuncao"> Renato Assuncao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a tree-based perturbation methodology for regionalization inference is presented. Regionalization is a constrained optimization problem that aims to create groups with similar attributes while satisfying spatial contiguity constraints. Similar to any constrained optimization problem, the spatial constraint may hinder convergence to some global minima, resulting in spatially contiguous members of a group with dissimilar attributes. This paper presents a general methodology for rigorously perturbing spatial constraints through the use of random spanning trees. The general framework presented can be used to quantify the effect of the spatial constraints in the overall regionalization result. We compare several types of stochastic spanning trees used in inference problems such as fuzzy regionalization and determining the number of regions. Performance of stochastic spanning trees is juxtaposed against the traditional permutation-based hypothesis testing frequently used in spatial statistics. Inference results for fuzzy regionalization and determining the number of regions is presented on the Local Area Personal Incomes for Texas Counties provided by the Bureau of Economic Analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=regionalization" title="regionalization">regionalization</a>, <a href="https://publications.waset.org/abstracts/search?q=constrained%20clustering" title=" constrained clustering"> constrained clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20inference" title=" probabilistic inference"> probabilistic inference</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20clustering" title=" fuzzy clustering"> fuzzy clustering</a> </p> <a href="https://publications.waset.org/abstracts/84786/tree-based-inference-for-regionalization-a-comparative-study-of-global-topological-perturbation-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84786.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">229</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">10</span> Major Depressive Disorder: Diagnosis based on Electroencephalogram Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wajid%20Mumtaz">Wajid Mumtaz</a>, <a href="https://publications.waset.org/abstracts/search?q=Aamir%20Saeed%20Malik"> Aamir Saeed Malik</a>, <a href="https://publications.waset.org/abstracts/search?q=Syed%20Saad%20Azhar%20Ali"> Syed Saad Azhar Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohd%20Azhar%20Mohd%20Yasin"> Mohd Azhar Mohd Yasin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a technique based on electroencephalogram (EEG) analysis is presented, aiming for diagnosing major depressive disorder (MDD) among a potential population of MDD patients and healthy controls. EEG is recognized as a clinical modality during applications such as seizure diagnosis, index for anesthesia, detection of brain death or stroke. However, its usability for psychiatric illnesses such as MDD is less studied. Therefore, in this study, for the sake of diagnosis, 2 groups of study participants were recruited, 1) MDD patients, 2) healthy people as controls. EEG data acquired from both groups were analyzed involving inter-hemispheric asymmetry and composite permutation entropy index (CPEI). To automate the process, derived quantities from EEG were utilized as inputs to classifier such as logistic regression (LR) and support vector machine (SVM). The learning of these classification models was tested with a test dataset. Their learning efficiency is provided as accuracy of classifying MDD patients from controls, their sensitivities and specificities were reported, accordingly (LR =81.7 % and SVM =81.5 %). Based on the results, it is concluded that the derived measures are indicators for diagnosing MDD from a potential population of normal controls. In addition, the results motivate further exploring other measures for the same purpose. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=major%20depressive%20disorder" title="major depressive disorder">major depressive disorder</a>, <a href="https://publications.waset.org/abstracts/search?q=diagnosis%20based%20on%20EEG" title=" diagnosis based on EEG"> diagnosis based on EEG</a>, <a href="https://publications.waset.org/abstracts/search?q=EEG%20derived%20features" title=" EEG derived features"> EEG derived features</a>, <a href="https://publications.waset.org/abstracts/search?q=CPEI" title=" CPEI"> CPEI</a>, <a href="https://publications.waset.org/abstracts/search?q=inter-hemispheric%20asymmetry" title=" inter-hemispheric asymmetry"> inter-hemispheric asymmetry</a> </p> <a href="https://publications.waset.org/abstracts/22303/major-depressive-disorder-diagnosis-based-on-electroencephalogram-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22303.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">546</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=Cayley%20permutation&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Cayley%20permutation&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>