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: Redundancy Matrix</title> <meta name="description" content="Search results for: Redundancy Matrix"> <meta name="keywords" content="Redundancy Matrix"> <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="Redundancy Matrix" 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="Redundancy Matrix"> <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> 2329</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Redundancy Matrix</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2329</span> Redundancy Component Matrix and Structural Robustness</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xinjian%20Kou">Xinjian Kou</a>, <a href="https://publications.waset.org/abstracts/search?q=Linlin%20Li"> Linlin Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Yongju%20Zhou"> Yongju Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Jimian%20Song"> Jimian Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We introduce the redundancy matrix that expresses clearly the geometrical/topological configuration of the structure. With the matrix, the redundancy of the structure is resolved into redundant components and assigned to each member or rigid joint. The values of the diagonal elements in the matrix indicates the importance of the corresponding members or rigid joints, and the geometrically correlations can be shown with the non-diagonal elements. If a member or rigid joint failures, reassignment of the redundant components can be calculated with the recursive method given in the paper. By combining the indexes of reliability and redundancy components, we define an index concerning the structural robustness. To further explain the properties of the redundancy matrix, we cited several examples of statically indeterminate structures, including two trusses and a rigid frame. With the examples, some simple results and the properties of the matrix are discussed. The examples also illustrate that the redundancy matrix and the relevant concepts are valuable in structural safety analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Structural%20Robustness" title="Structural Robustness">Structural Robustness</a>, <a href="https://publications.waset.org/abstracts/search?q=Structural%20Reliability" title=" Structural Reliability"> Structural Reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=Redundancy%20Component" title=" Redundancy Component"> Redundancy Component</a>, <a href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix" title=" Redundancy Matrix"> Redundancy Matrix</a> </p> <a href="https://publications.waset.org/abstracts/66420/redundancy-component-matrix-and-structural-robustness" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66420.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">272</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">2328</span> Performance and Availability Analysis of 2N Redundancy Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yutae%20Lee">Yutae Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider the performance and availability of a redundancy model. The redundancy model is a form of resilience that ensures service availability in the event of component failure. This paper considers a 2N redundancy model. In the model there are at most one active service unit and at most one standby service unit. The active one is providing the service while the standby is prepared to take over the active role when the active fails. We design our analysis model using Stochastic Reward Nets, and then evaluate the performance and availability of 2N redundancy model using Stochastic Petri Net Package (SPNP). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=availability" title="availability">availability</a>, <a href="https://publications.waset.org/abstracts/search?q=performance" title=" performance"> performance</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20reward%20net" title=" stochastic reward net"> stochastic reward net</a>, <a href="https://publications.waset.org/abstracts/search?q=2N%20redundancy" title=" 2N redundancy"> 2N redundancy</a> </p> <a href="https://publications.waset.org/abstracts/40741/performance-and-availability-analysis-of-2n-redundancy-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40741.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">421</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">2327</span> A Mathematical Model for Reliability Redundancy Optimization Problem of K-Out-Of-N: G System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gak-Gyu%20Kim">Gak-Gyu Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Won%20Il%20Jung"> Won Il Jung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> According to a remarkable development of science and technology, function and role of the system of engineering fields has recently been diversified. The system has become increasingly more complex and precise, and thus, system designers intended to maximize reliability concentrate more effort at the design stage. This study deals with the reliability redundancy optimization problem (RROP) for k-out-of-n: G system configuration with cold standby and warm standby components. This paper further intends to present the optimal mathematical model through which the following three elements of (i) multiple components choices, (ii) redundant components quantity and (iii) the choice of redundancy strategies may be combined in order to maximize the reliability of the system. Therefore, we focus on the following three issues. First, we consider RROP that there exists warm standby state as well as cold standby state of the component. Second, as eliminating an approximation approach of the previous RROP studies, we construct a precise model for system reliability. Third, given transition time when the state of components changes, we present not simply a workable solution but the advanced method. For the wide applicability of RROPs, moreover, we use absorbing continuous time Markov chain and matrix analytic methods in the suggested mathematical model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=RROP" title="RROP">RROP</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20analytic%20methods" title=" matrix analytic methods"> matrix analytic methods</a>, <a href="https://publications.waset.org/abstracts/search?q=k-out-of-n%3A%20G%20system" title=" k-out-of-n: G system"> k-out-of-n: G system</a>, <a href="https://publications.waset.org/abstracts/search?q=MTTF" title=" MTTF"> MTTF</a>, <a href="https://publications.waset.org/abstracts/search?q=absorbing%20continuous%20time%20Markov%20Chain" title=" absorbing continuous time Markov Chain"> absorbing continuous time Markov Chain</a> </p> <a href="https://publications.waset.org/abstracts/66196/a-mathematical-model-for-reliability-redundancy-optimization-problem-of-k-out-of-n-g-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66196.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">254</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">2326</span> Designing a Cyclic Redundancy Checker-8 for 32 Bit Input Using VHDL</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ankit%20Shai">Ankit Shai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> CRC or Cyclic Redundancy Check is one of the most common, and one of the most powerful error-detecting codes implemented on modern computers. Most of the modern communication protocols use some error detection algorithms in digital networks and storage devices to detect accidental changes to raw data between transmission and reception. Cyclic Redundancy Check, or CRC, is the most popular one among these error detection codes. CRC properties are defined by the generator polynomial length and coefficients. The aim of this project is to implement an efficient FPGA based CRC-8 that accepts a 32 bit input, taking into consideration optimal chip area and high performance, using VHDL. The proposed architecture is implemented on Xilinx ISE Simulator. It is designed while keeping in mind the hardware design, complexity and cost factor. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cyclic%20redundancy%20checker" title="cyclic redundancy checker">cyclic redundancy checker</a>, <a href="https://publications.waset.org/abstracts/search?q=CRC-8" title=" CRC-8"> CRC-8</a>, <a href="https://publications.waset.org/abstracts/search?q=32-bit%20input" title=" 32-bit input"> 32-bit input</a>, <a href="https://publications.waset.org/abstracts/search?q=FPGA" title=" FPGA"> FPGA</a>, <a href="https://publications.waset.org/abstracts/search?q=VHDL" title=" VHDL"> VHDL</a>, <a href="https://publications.waset.org/abstracts/search?q=ModelSim" title=" ModelSim"> ModelSim</a>, <a href="https://publications.waset.org/abstracts/search?q=Xilinx" title=" Xilinx"> Xilinx</a> </p> <a href="https://publications.waset.org/abstracts/10861/designing-a-cyclic-redundancy-checker-8-for-32-bit-input-using-vhdl" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10861.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">292</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">2325</span> A Hybrid P2P Storage Scheme Based on Erasure Coding and Replication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Usman%20Mahmood">Usman Mahmood</a>, <a href="https://publications.waset.org/abstracts/search?q=Khawaja%20M.%20U.%20Suleman"> Khawaja M. U. Suleman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A peer-to-peer storage system has challenges like; peer availability, data protection, churn rate. To address these challenges different redundancy, replacement and repair schemes are used. This paper presents a hybrid scheme of redundancy using replication and erasure coding. We calculate and compare the storage, access, and maintenance costs of our proposed scheme with existing redundancy schemes. For realistic behaviour of peers a trace of live peer-to-peer system is used. The effect of different replication, and repair schemes are also shown. The proposed hybrid scheme performs better than existing double coding hybrid scheme in all metrics and have an improved maintenance cost than hierarchical codes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=erasure%20coding" title="erasure coding">erasure coding</a>, <a href="https://publications.waset.org/abstracts/search?q=P2P" title=" P2P"> P2P</a>, <a href="https://publications.waset.org/abstracts/search?q=redundancy" title=" redundancy"> redundancy</a>, <a href="https://publications.waset.org/abstracts/search?q=replication" title=" replication"> replication</a> </p> <a href="https://publications.waset.org/abstracts/37720/a-hybrid-p2p-storage-scheme-based-on-erasure-coding-and-replication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37720.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">394</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">2324</span> Reliability and Cost Focused Optimization Approach for a Communication Satellite Payload Redundancy Allocation Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mehmet%20Nefes">Mehmet Nefes</a>, <a href="https://publications.waset.org/abstracts/search?q=Selman%20Demirel"> Selman Demirel</a>, <a href="https://publications.waset.org/abstracts/search?q=Hasan%20H.%20Ertok"> Hasan H. Ertok</a>, <a href="https://publications.waset.org/abstracts/search?q=Cenk%20Sen"> Cenk Sen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A typical reliability engineering problem regarding communication satellites has been considered to determine redundancy allocation scheme of power amplifiers within payload transponder module, whose dominant function is to amplify power levels of the received signals from the Earth, through maximizing reliability against mass, power, and other technical limitations. Adding each redundant power amplifier component increases not only reliability but also hardware, testing, and launch cost of a satellite. This study investigates a multi-objective approach used in order to solve Redundancy Allocation Problem (RAP) for a communication satellite payload transponder, focusing on design cost due to redundancy and reliability factors. The main purpose is to find the optimum power amplifier redundancy configuration satisfying reliability and capacity thresholds simultaneously instead of analyzing respectively or independently. A mathematical model and calculation approach are instituted including objective function definitions, and then, the problem is solved analytically with different input parameters in MATLAB environment. Example results showed that payload capacity and failure rate of power amplifiers have remarkable effects on the solution and also processing time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=communication%20satellite%20payload" title="communication satellite payload">communication satellite payload</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=redundancy%20allocation%20problem" title=" redundancy allocation problem"> redundancy allocation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability" title=" reliability"> reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=transponder" title=" transponder"> transponder</a> </p> <a href="https://publications.waset.org/abstracts/86236/reliability-and-cost-focused-optimization-approach-for-a-communication-satellite-payload-redundancy-allocation-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86236.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">261</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">2323</span> Multi-Objective Optimization of Combined System Reliability and Redundancy Allocation Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vijaya%20K.%20Srivastava">Vijaya K. Srivastava</a>, <a href="https://publications.waset.org/abstracts/search?q=Davide%20Spinello"> Davide Spinello</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents established 3<strong><sup>n</sup></strong> enumeration procedure for mixed integer optimization problems for solving multi-objective reliability and redundancy allocation problem subject to design constraints. The formulated problem is to find the optimum level of unit reliability and the number of units for each subsystem. A number of illustrative examples are provided and compared to indicate the application of the superiority of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title="integer programming">integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20programming" title=" mixed integer programming"> mixed integer programming</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=Reliability%20Redundancy%20Allocation" title=" Reliability Redundancy Allocation"> Reliability Redundancy Allocation</a> </p> <a href="https://publications.waset.org/abstracts/107208/multi-objective-optimization-of-combined-system-reliability-and-redundancy-allocation-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/107208.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">172</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">2322</span> The Second Smallest Eigenvalue of Complete Tripartite Hypergraph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alfi%20Y.%20Zakiyyah">Alfi Y. Zakiyyah</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanni%20Garminia"> Hanni Garminia</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Salman"> M. Salman</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20N.%20Irawati"> A. N. Irawati</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the terminology of the hypergraph, there is a relation with the terminology graph. In the theory of graph, the edges connected two vertices. In otherwise, in hypergraph, the edges can connect more than two vertices. There is representation matrix of a graph such as adjacency matrix, Laplacian matrix, and incidence matrix. The adjacency matrix is symmetry matrix so that all eigenvalues is real. This matrix is a nonnegative matrix. The all diagonal entry from adjacency matrix is zero so that the trace is zero. Another representation matrix of the graph is the Laplacian matrix. Laplacian matrix is symmetry matrix and semidefinite positive so that all eigenvalues are real and non-negative. According to the spectral study in the graph, some that result is generalized to hypergraph. A hypergraph can be represented by a matrix such as adjacency, incidence, and Laplacian matrix. Throughout for this term, we use Laplacian matrix to represent a complete tripartite hypergraph. The aim from this research is to determine second smallest eigenvalues from this matrix and find a relation this eigenvalue with the connectivity of that hypergraph. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=connectivity" title="connectivity">connectivity</a>, <a href="https://publications.waset.org/abstracts/search?q=graph" title=" graph"> graph</a>, <a href="https://publications.waset.org/abstracts/search?q=hypergraph" title=" hypergraph"> hypergraph</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix" title=" Laplacian matrix"> Laplacian matrix</a> </p> <a href="https://publications.waset.org/abstracts/34000/the-second-smallest-eigenvalue-of-complete-tripartite-hypergraph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34000.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">488</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">2321</span> A Novel Meta-Heuristic Algorithm Based on Cloud Theory for Redundancy Allocation Problem under Realistic Condition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20Mousavi">H. Mousavi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Sharifi"> M. Sharifi</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Pourvaziri"> H. Pourvaziri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Redundancy Allocation Problem (RAP) is a well-known mathematical problem for modeling series-parallel systems. It is a combinatorial optimization problem which focuses on determining an optimal assignment of components in a system design. In this paper, to be more practical, we have considered the problem of redundancy allocation of series system with interval valued reliability of components. Therefore, during the search process, the reliabilities of the components are considered as a stochastic variable with a lower and upper bounds. In order to optimize the problem, we proposed a simulated annealing based on cloud theory (CBSAA). Also, the Monte Carlo simulation (MCS) is embedded to the CBSAA to handle the random variable components’ reliability. This novel approach has been investigated by numerical examples and the experimental results have shown that the CBSAA combining MCS is an efficient tool to solve the RAP of systems with interval-valued component reliabilities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=redundancy%20allocation%20problem" title="redundancy allocation problem">redundancy allocation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20theory" title=" cloud theory"> cloud theory</a>, <a href="https://publications.waset.org/abstracts/search?q=monte%20carlo%20simulation" title=" monte carlo simulation"> monte carlo simulation</a> </p> <a href="https://publications.waset.org/abstracts/33681/a-novel-meta-heuristic-algorithm-based-on-cloud-theory-for-redundancy-allocation-problem-under-realistic-condition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33681.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">412</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">2320</span> Conditions on Expressing a Matrix as a Sum of α-Involutions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ric%20Joseph%20R.%20Murillo">Ric Joseph R. Murillo</a>, <a href="https://publications.waset.org/abstracts/search?q=Edna%20N.%20Gueco"> Edna N. Gueco</a>, <a href="https://publications.waset.org/abstracts/search?q=Dennis%20I.%20Merino"> Dennis I. Merino</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let F be C or R, where C and R are the set of complex numbers and real numbers, respectively, and n be a natural number. An n-by-n matrix A over the field F is called an α-involutory matrix or an α-involution if there exists an α in the field such that the square of the matrix is equal to αI, where I is the n-by-n identity matrix. If α is a complex number or a nonnegative real number, then an n-by-n matrix A over the field F can be written as a sum of n-by-n α-involutory matrices over the field F if and only if the trace of that matrix is an integral multiple of the square root of α. Meanwhile, if α is a negative real number, then a 2n-by-2n matrix A over R can be written as a sum of 2n-by-2n α-involutory matrices over R if and only the trace of the matrix is zero. Some other properties of α-involutory matrices are also determined <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=%CE%B1-involutory%20Matrices" title="α-involutory Matrices">α-involutory Matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=sum%20of%20%CE%B1-involutory%20Matrices" title=" sum of α-involutory Matrices"> sum of α-involutory Matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=Trace" title=" Trace"> Trace</a>, <a href="https://publications.waset.org/abstracts/search?q=Matrix%20Theory" title=" Matrix Theory"> Matrix Theory</a> </p> <a href="https://publications.waset.org/abstracts/95131/conditions-on-expressing-a-matrix-as-a-sum-of-a-involutions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95131.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">198</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">2319</span> Reductive Control in the Management of Redundant Actuation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mkhinini%20Maher">Mkhinini Maher</a>, <a href="https://publications.waset.org/abstracts/search?q=Knani%20Jilani"> Knani Jilani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present in this work the performances of a mobile omnidirectional robot through evaluating its management of the redundancy of actuation. Thus we come to the predictive control implemented. The distribution of the wringer on the robot actions, through the inverse pseudo of Moore-Penrose, corresponds to a -geometric- distribution of efforts. We will show that the load on vehicle wheels would not be equi-distributed in terms of wheels configuration and of robot movement. Thus, the threshold of sliding is not the same for the three wheels of the vehicle. We suggest exploiting the redundancy of actuation to reduce the risk of wheels sliding and to ameliorate, thereby, its accuracy of displacement. This kind of approach was the subject of study for the legged robots. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mobile%20robot" title="mobile robot">mobile robot</a>, <a href="https://publications.waset.org/abstracts/search?q=actuation" title=" actuation"> actuation</a>, <a href="https://publications.waset.org/abstracts/search?q=redundancy" title=" redundancy"> redundancy</a>, <a href="https://publications.waset.org/abstracts/search?q=omnidirectional" title=" omnidirectional"> omnidirectional</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20pseudo%20moore-penrose" title=" inverse pseudo moore-penrose"> inverse pseudo moore-penrose</a>, <a href="https://publications.waset.org/abstracts/search?q=reductive%20control" title=" reductive control"> reductive control</a> </p> <a href="https://publications.waset.org/abstracts/3204/reductive-control-in-the-management-of-redundant-actuation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3204.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">511</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">2318</span> A Preliminary Study of Urban Resident Space Redundancy in the Context of Rapid Urbanization: Based on Urban Research of Hongkou District of Shanghai</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ziwei%20Chen">Ziwei Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Yujiang%20Gao"> Yujiang Gao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The rapid urbanization has caused the massive physical space in Chinese cities to be in a state of duplication and dislocation through the rapid development, forming many daily spaces that cannot be standardized, typed, and identified, such as illegal construction. This phenomenon is known as urban spatial redundancy and is often excluded from mainstream architectural discussions because of its 'remaining' and 'excessive' derogatory label. In recent years, some practice architects have begun to pay attention to this phenomenon and tried to tap the value behind it. In this context, the author takes the redundancy phenomenon of resident space as the research object and explores the inspiration to the urban architectural renewal and the innovative residential area model, based on the urban survey of redundant living space in Hongkou District of Shanghai. On this basis, it shows that the changes accumulated in the long-term use of the building can be re-applied to the goals before the design, which is an important link and significance of the existence of an architecture. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=rapid%20urbanization" title="rapid urbanization">rapid urbanization</a>, <a href="https://publications.waset.org/abstracts/search?q=living%20space%20redundancy" title=" living space redundancy"> living space redundancy</a>, <a href="https://publications.waset.org/abstracts/search?q=architectural%20renewal" title=" architectural renewal"> architectural renewal</a>, <a href="https://publications.waset.org/abstracts/search?q=residential%20area%20model" title=" residential area model"> residential area model</a> </p> <a href="https://publications.waset.org/abstracts/93404/a-preliminary-study-of-urban-resident-space-redundancy-in-the-context-of-rapid-urbanization-based-on-urban-research-of-hongkou-district-of-shanghai" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93404.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">135</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">2317</span> Instructional Consequences of the Transiency of Spoken Words </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Slava%20Kalyuga">Slava Kalyuga</a>, <a href="https://publications.waset.org/abstracts/search?q=Sujanya%20Sombatteera"> Sujanya Sombatteera </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In multimedia learning, written text is often transformed into spoken (narrated) text. This transient information may overwhelm limited processing capacity of working memory and inhibit learning instead of improving it. The paper reviews recent empirical studies in modality and verbal redundancy effects within a cognitive load framework and outlines conditions under which negative effects of transiency may occur. According to the modality effect, textual information accompanying pictures should be presented in an auditory rather than visual form in order to engage two available channels of working memory – auditory and visual - instead of only one of them. However, some studies failed to replicate the modality effect and found differences opposite to those expected. Also, according to the multimedia redundancy effect, the same information should not be presented simultaneously in different modalities to avoid unnecessary cognitive load imposed by the integration of redundant sources of information. However, a few studies failed to replicate the multimedia redundancy effect too. Transiency of information is used to explain these controversial results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cognitive%20load" title="cognitive load">cognitive load</a>, <a href="https://publications.waset.org/abstracts/search?q=transient%20information" title=" transient information"> transient information</a>, <a href="https://publications.waset.org/abstracts/search?q=modality%20effect" title=" modality effect"> modality effect</a>, <a href="https://publications.waset.org/abstracts/search?q=verbal%20redundancy%20effect" title=" verbal redundancy effect"> verbal redundancy effect</a> </p> <a href="https://publications.waset.org/abstracts/14122/instructional-consequences-of-the-transiency-of-spoken-words" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14122.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">380</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">2316</span> Redundancy in Malay Morphology: School Grammar versus Corpus Grammar </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zaharani%20Ahmad">Zaharani Ahmad</a>, <a href="https://publications.waset.org/abstracts/search?q=Nor%20Hashimah%20Jalaluddin"> Nor Hashimah Jalaluddin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this paper is to examine and identify the issue of linguistic redundancy in two competing grammars of Malay, namely the school grammar and the corpus grammar. The former is a normative grammar which is formally and prescriptively taught in the classroom, whereas the latter is a descriptive grammar that is informally acquired and mastered by the students as native speakers of the language outside the classroom. Corpus grammar is depicted based on its actual used in natural occurring texts, as attested in the corpus. It is observed that the grammar taught in schools is incompatible with the grammar used in the corpus. For instance, a noun phrase containing nominal reduplicated form which denotes plurality (i.e. murid-murid ‘students’ which is derived from murid ‘student’) and a modifier categorized as quantifiers (i.e. semua ‘all’, seluruh ‘entire’, and kebanyakan ‘most’) is not acceptable in the school grammar because the formation (i.e. semua murid-murid ‘all the students’ kebanyakan pelajar-pelajar ‘most of the students’) is claimed to be redundant, and redundancy is prohibited in the grammar. Redundancy is generally construed as the property of speech and language by which more information is provided than is precisely required for the message to be understood, so that, if some information is omitted, the remaining information will still be sufficient for the message to be comprehended. Thus, the correct construction to be used is strictly the reduplicated form (i.e. murid-murid ‘students’) or the quantifier plus the root (i.e. semua murid ‘all the students’) with the intention that the grammatical meaning of plural is not repeated. Nevertheless, the so-called redundant form (i.e. kebanyakan pelajar-pelajar ‘most of the students’) is frequently used in the corpus grammar. This study shows that there are a number of redundant forms occur in the morphology of the language, particularly in affixation, reduplication and combination of both. Apparently, the so-called redundancy has grammatical and socio-cultural functions in communication that is to give emphasis and to stress the importance of the information delivered by the speakers or writers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=corpus%20grammar" title="corpus grammar">corpus grammar</a>, <a href="https://publications.waset.org/abstracts/search?q=morphology" title=" morphology"> morphology</a>, <a href="https://publications.waset.org/abstracts/search?q=redundancy" title=" redundancy"> redundancy</a>, <a href="https://publications.waset.org/abstracts/search?q=school%20grammar" title=" school grammar"> school grammar</a> </p> <a href="https://publications.waset.org/abstracts/42192/redundancy-in-malay-morphology-school-grammar-versus-corpus-grammar" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42192.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">342</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">2315</span> Manufacturing and Characterization of Ni-Matrix Composite Reinforced with Ti3SiC2 and Ti2AlC; and Al-Matrix with Ti2SiC</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Hadji">M. Hadji</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Chiker"> N. Chiker</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Hadji"> Y. Hadji</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Haddad"> A. Haddad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we report for the first time on the synthesis and characterization of novel MAX phases (Ti3SiC2, Ti2AlC) reinforced Ni-matrix and Ti2AlC reinforced Al-matrix. The stability of MAX phases in Al-matrix and Ni-matrix at a temperature of 985°C has been investigated. All the composites were cold pressed and sintered at a temperature of 985°C for 20min in H2 environment, except (Ni/Ti3SiC2) who was sintered at 1100°C for 1h.Microstructure analysis by scanning electron microscopy and phase analysis by X-Ray diffraction confirmed that there was minimal interfacial reaction between MAX particles and Ni, thus Al/MAX samples shown that MAX phases was totally decomposed at 985°C.The Addition of MAX enhanced the Al-matrix and Ni-matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=MAX%20phase" title="MAX phase">MAX phase</a>, <a href="https://publications.waset.org/abstracts/search?q=microstructures" title=" microstructures"> microstructures</a>, <a href="https://publications.waset.org/abstracts/search?q=composites" title=" composites"> composites</a>, <a href="https://publications.waset.org/abstracts/search?q=hardness" title=" hardness"> hardness</a>, <a href="https://publications.waset.org/abstracts/search?q=SEM" title=" SEM"> SEM</a> </p> <a href="https://publications.waset.org/abstracts/40223/manufacturing-and-characterization-of-ni-matrix-composite-reinforced-with-ti3sic2-and-ti2alc-and-al-matrix-with-ti2sic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40223.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">347</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">2314</span> Inverse Matrix in the Theory of Dynamical Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Renata%20Masarova">Renata Masarova</a>, <a href="https://publications.waset.org/abstracts/search?q=Bohuslava%20Juhasova"> Bohuslava Juhasova</a>, <a href="https://publications.waset.org/abstracts/search?q=Martin%20Juhas"> Martin Juhas</a>, <a href="https://publications.waset.org/abstracts/search?q=Zuzana%20Sutova"> Zuzana Sutova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In dynamic system theory a mathematical model is often used to describe their properties. In order to find a transfer matrix of a dynamic system we need to calculate an inverse matrix. The paper contains the fusion of the classical theory and the procedures used in the theory of automated control for calculating the inverse matrix. The final part of the paper models the given problem by the Matlab. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20system" title="dynamic system">dynamic system</a>, <a href="https://publications.waset.org/abstracts/search?q=transfer%20matrix" title=" transfer matrix"> transfer matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20matrix" title=" inverse matrix"> inverse matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=modeling" title=" modeling "> modeling </a> </p> <a href="https://publications.waset.org/abstracts/22680/inverse-matrix-in-the-theory-of-dynamical-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22680.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">516</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">2313</span> On the Application of Heuristics of the Traveling Salesman Problem for the Task of Restoring the DNA Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Boris%20Melnikov">Boris Melnikov</a>, <a href="https://publications.waset.org/abstracts/search?q=Dmitrii%20Chaikovskii"> Dmitrii Chaikovskii</a>, <a href="https://publications.waset.org/abstracts/search?q=Elena%20Melnikova"> Elena Melnikova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The traveling salesman problem (TSP) is a well-known optimization problem that seeks to find the shortest possible route that visits a set of points and returns to the starting point. In this paper, we apply some heuristics of the TSP for the task of restoring the DNA matrix. This restoration problem is often considered in biocybernetics. For it, we must recover the matrix of distances between DNA sequences if not all the elements of the matrix under consideration are known at the input. We consider the possibility of using this method in the testing of distance calculation algorithms between a pair of DNAs to restore the partially filled matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimization%20problems" title="optimization problems">optimization problems</a>, <a href="https://publications.waset.org/abstracts/search?q=DNA%20matrix" title=" DNA matrix"> DNA matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=partially%20filled%20matrix" title=" partially filled matrix"> partially filled matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20algorithms" title=" heuristic algorithms"> heuristic algorithms</a> </p> <a href="https://publications.waset.org/abstracts/172868/on-the-application-of-heuristics-of-the-traveling-salesman-problem-for-the-task-of-restoring-the-dna-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/172868.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">150</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">2312</span> On Block Vandermonde Matrix Constructed from Matrix Polynomial Solvents</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malika%20Yaici">Malika Yaici</a>, <a href="https://publications.waset.org/abstracts/search?q=Kamel%20Hariche"> Kamel Hariche</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In control engineering, systems described by matrix fractions are studied through properties of block roots, also called solvents. These solvents are usually dealt with in a block Vandermonde matrix form. Inverses and determinants of Vandermonde matrices and block Vandermonde matrices are used in solving problems of numerical analysis in many domains but require costly computations. Even though Vandermonde matrices are well known and method to compute inverse and determinants are many and, generally, based on interpolation techniques, methods to compute the inverse and determinant of a block Vandermonde matrix have not been well studied. In this paper, some properties of these matrices and iterative algorithms to compute the determinant and the inverse of a block Vandermonde matrix are given. These methods are deducted from the partitioned matrix inversion and determinant computing methods. Due to their great size, parallelization may be a solution to reduce the computations cost, so a parallelization of these algorithms is proposed and validated by a comparison using algorithmic complexity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=block%20vandermonde%20matrix" title="block vandermonde matrix">block vandermonde matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=solvents" title=" solvents"> solvents</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20polynomial" title=" matrix polynomial"> matrix polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20inverse" title=" matrix inverse"> matrix inverse</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20determinant" title=" matrix determinant"> matrix determinant</a>, <a href="https://publications.waset.org/abstracts/search?q=parallelization" title=" parallelization"> parallelization</a> </p> <a href="https://publications.waset.org/abstracts/89115/on-block-vandermonde-matrix-constructed-from-matrix-polynomial-solvents" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89115.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">240</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">2311</span> Fault Detection and Isolation of a Three-Tank System using Analytical Temporal Redundancy, Parity Space/Relation Based Residual Generation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20T.%20Kuda">A. T. Kuda</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20J.%20Dayya"> J. J. Dayya</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Jimoh"> A. Jimoh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper investigates the fault detection and Isolation technique of measurement data sets from a three tank system using analytical model-based temporal redundancy which is based on residual generation using parity equations/space approach. It further briefly outlines other approaches of model-based residual generation. The basic idea of parity space residual generation in temporal redundancy is dynamic relationship between sensor outputs and actuator inputs (input-output model). These residuals where then used to detect whether or not the system is faulty and indicate the location of the fault when it is faulty. The method obtains good results by detecting and isolating faults from the considered data sets measurements generated from the system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fault%20detection" title="fault detection">fault detection</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20isolation" title=" fault isolation"> fault isolation</a>, <a href="https://publications.waset.org/abstracts/search?q=disturbing%20influences" title=" disturbing influences"> disturbing influences</a>, <a href="https://publications.waset.org/abstracts/search?q=system%20failure" title=" system failure"> system failure</a>, <a href="https://publications.waset.org/abstracts/search?q=parity%20equation%2Frelation" title=" parity equation/relation"> parity equation/relation</a>, <a href="https://publications.waset.org/abstracts/search?q=structured%20parity%20equations" title=" structured parity equations"> structured parity equations</a> </p> <a href="https://publications.waset.org/abstracts/9886/fault-detection-and-isolation-of-a-three-tank-system-using-analytical-temporal-redundancy-parity-spacerelation-based-residual-generation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9886.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">302</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">2310</span> An Adaptive Dimensionality Reduction Approach for Hyperspectral Imagery Semantic Interpretation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Akrem%20Sellami">Akrem Sellami</a>, <a href="https://publications.waset.org/abstracts/search?q=Imed%20Riadh%20Farah"> Imed Riadh Farah</a>, <a href="https://publications.waset.org/abstracts/search?q=Basel%20Solaiman"> Basel Solaiman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the development of HyperSpectral Imagery (HSI) technology, the spectral resolution of HSI became denser, which resulted in large number of spectral bands, high correlation between neighboring, and high data redundancy. However, the semantic interpretation is a challenging task for HSI analysis due to the high dimensionality and the high correlation of the different spectral bands. In fact, this work presents a dimensionality reduction approach that allows to overcome the different issues improving the semantic interpretation of HSI. Therefore, in order to preserve the spatial information, the Tensor Locality Preserving Projection (TLPP) has been applied to transform the original HSI. In the second step, knowledge has been extracted based on the adjacency graph to describe the different pixels. Based on the transformation matrix using TLPP, a weighted matrix has been constructed to rank the different spectral bands based on their contribution score. Thus, the relevant bands have been adaptively selected based on the weighted matrix. The performance of the presented approach has been validated by implementing several experiments, and the obtained results demonstrate the efficiency of this approach compared to various existing dimensionality reduction techniques. Also, according to the experimental results, we can conclude that this approach can adaptively select the relevant spectral improving the semantic interpretation of HSI. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=band%20selection" title="band selection">band selection</a>, <a href="https://publications.waset.org/abstracts/search?q=dimensionality%20reduction" title=" dimensionality reduction"> dimensionality reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=feature%20extraction" title=" feature extraction"> feature extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=hyperspectral%20imagery" title=" hyperspectral imagery"> hyperspectral imagery</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20interpretation" title=" semantic interpretation"> semantic interpretation</a> </p> <a href="https://publications.waset.org/abstracts/55370/an-adaptive-dimensionality-reduction-approach-for-hyperspectral-imagery-semantic-interpretation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55370.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">2309</span> Key Frame Based Video Summarization via Dependency Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Janya%20Sainui">Janya Sainui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As a rapid growth of digital videos and data communications, video summarization that provides a shorter version of the video for fast video browsing and retrieval is necessary. Key frame extraction is one of the mechanisms to generate video summary. In general, the extracted key frames should both represent the entire video content and contain minimum redundancy. However, most of the existing approaches heuristically select key frames; hence, the selected key frames may not be the most different frames and/or not cover the entire content of a video. In this paper, we propose a method of video summarization which provides the reasonable objective functions for selecting key frames. In particular, we apply a statistical dependency measure called quadratic mutual informaion as our objective functions for maximizing the coverage of the entire video content as well as minimizing the redundancy among selected key frames. The proposed key frame extraction algorithm finds key frames as an optimization problem. Through experiments, we demonstrate the success of the proposed video summarization approach that produces video summary with better coverage of the entire video content while less redundancy among key frames comparing to the state-of-the-art approaches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=video%20summarization" title="video summarization">video summarization</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20frame%20extraction" title=" key frame extraction"> key frame extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=dependency%20measure" title=" dependency measure"> dependency measure</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20mutual%20information" title=" quadratic mutual information"> quadratic mutual information</a> </p> <a href="https://publications.waset.org/abstracts/75218/key-frame-based-video-summarization-via-dependency-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75218.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">266</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2308</span> On Direct Matrix Factored Inversion via Broyden's Updates</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adel%20Mohsen">Adel Mohsen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A direct method based on the good Broyden's updates for evaluating the inverse of a nonsingular square matrix of full rank and solving related system of linear algebraic equations is studied. For a matrix A of order n whose LU-decomposition is A = LU, the multiplication count is O (n3). This includes the evaluation of the LU-decompositions of the inverse, the lower triangular decomposition of A as well as a “reduced matrix inverse”. If an explicit value of the inverse is not needed the order reduces to O (n3/2) to compute to compute inv(U) and the reduced inverse. For a symmetric matrix only O (n3/3) operations are required to compute inv(L) and the reduced inverse. An example is presented to demonstrate the capability of using the reduced matrix inverse in treating ill-conditioned systems. Besides the simplicity of Broyden's update, the method provides a mean to exploit the possible sparsity in the matrix and to derive a suitable preconditioner. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Broyden%27s%20updates" title="Broyden's updates">Broyden's updates</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20inverse" title=" matrix inverse"> matrix inverse</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20factorization" title=" inverse factorization"> inverse factorization</a>, <a href="https://publications.waset.org/abstracts/search?q=solution%20of%20linear%20algebraic%20equations" title=" solution of linear algebraic equations"> solution of linear algebraic equations</a>, <a href="https://publications.waset.org/abstracts/search?q=ill-conditioned%20matrices" title=" ill-conditioned matrices"> ill-conditioned matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=preconditioning" title=" preconditioning"> preconditioning</a> </p> <a href="https://publications.waset.org/abstracts/22126/on-direct-matrix-factored-inversion-via-broydens-updates" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22126.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">479</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">2307</span> A Review on Aluminium Metal Matric Composites</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=V.%20Singh">V. Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Singh"> S. Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20S.%20Garewal"> S. S. Garewal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Metal matrix composites with aluminum as the matrix material have been heralded as the next great development in advanced engineering materials. Aluminum metal matrix composites (AMMC) refer to the class of light weight high performance material systems. Properties of AMMCs can be tailored to the demands of different industrial applications by suitable combinations of matrix, reinforcement and processing route. AMMC finds its application in automotive, aerospace, defense, sports and structural areas. This paper presents an overview of AMMC material systems on aspects relating to processing, types and applications with case studies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aluminum%20metal%20matrix%20composites" title="aluminum metal matrix composites">aluminum metal matrix composites</a>, <a href="https://publications.waset.org/abstracts/search?q=applications%20of%20aluminum%20metal%20matrix%20composites" title=" applications of aluminum metal matrix composites"> applications of aluminum metal matrix composites</a>, <a href="https://publications.waset.org/abstracts/search?q=lighting%20material%20processing%20of%20aluminum%20metal%20matrix%20composites" title=" lighting material processing of aluminum metal matrix composites"> lighting material processing of aluminum metal matrix composites</a> </p> <a href="https://publications.waset.org/abstracts/62849/a-review-on-aluminium-metal-matric-composites" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62849.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">465</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">2306</span> Numerical Simulation of Effect of Various Rib Configurations on Enhancing Heat Transfer of Matrix Cooling Channel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seok%20Min%20Choi">Seok Min Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Minho%20Bang"> Minho Bang</a>, <a href="https://publications.waset.org/abstracts/search?q=Seuong%20Yun%20Kim"> Seuong Yun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyungmin%20Lee"> Hyungmin Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Won-Gu%20Joo"> Won-Gu Joo</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyung%20Hee%20Cho"> Hyung Hee Cho</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The matrix cooling channel was used for gas turbine blade cooling passage. The matrix cooling structure is useful for the structure stability however the cooling performance of internal cooling channel was not enough for cooling. Therefore, we designed the rib configurations in the matrix cooling channel to enhance the cooling performance. The numerical simulation was conducted to analyze cooling performance of rib configured matrix cooling channel. Three different rib configurations were used which are vertical rib, angled rib and c-type rib. Three configurations were adopted in two positions of matrix cooling channel which is one fourth and three fourth of channel. The result shows that downstream rib has much higher cooling performance than upstream rib. Furthermore, the angled rib in the channel has much higher cooling performance than vertical rib. This is because; the angled rib improves the swirl effect of matrix cooling channel more effectively. The friction factor was increased with the installation of rib. However, the thermal performance was increased with the installation of rib in the matrix cooling channel. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matrix%20cooling" title="matrix cooling">matrix cooling</a>, <a href="https://publications.waset.org/abstracts/search?q=rib" title=" rib"> rib</a>, <a href="https://publications.waset.org/abstracts/search?q=heat%20transfer" title=" heat transfer"> heat transfer</a>, <a href="https://publications.waset.org/abstracts/search?q=gas%20turbine" title=" gas turbine"> gas turbine</a> </p> <a href="https://publications.waset.org/abstracts/80524/numerical-simulation-of-effect-of-various-rib-configurations-on-enhancing-heat-transfer-of-matrix-cooling-channel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80524.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">460</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">2305</span> Parallel Computation of the Covariance-Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Claude%20Tadonki">Claude Tadonki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We address the issues related to the computation of the covariance matrix. This matrix is likely to be ill conditioned following its canonical expression, thus consequently raises serious numerical issues. The underlying linear system, which therefore should be solved by means of iterative approaches, becomes computationally challenging. A huge number of iterations is expected in order to reach an acceptable level of convergence, necessary to meet the required accuracy of the computation. In addition, this linear system needs to be solved at each iteration following the general form of the covariance matrix. Putting all together, its comes that we need to compute as fast as possible the associated matrix-vector product. This is our purpose in the work, where we consider and discuss skillful formulations of the problem, then propose a parallel implementation of the matrix-vector product involved. Numerical and performance oriented discussions are provided based on experimental evaluations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=covariance-matrix" title="covariance-matrix">covariance-matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=multicore" title=" multicore"> multicore</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20computing" title=" numerical computing"> numerical computing</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title=" parallel computing"> parallel computing</a> </p> <a href="https://publications.waset.org/abstracts/59579/parallel-computation-of-the-covariance-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59579.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">312</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">2304</span> Constructions of Linear and Robust Codes Based on Wavelet Decompositions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alla%20Levina">Alla Levina</a>, <a href="https://publications.waset.org/abstracts/search?q=Sergey%20Taranov"> Sergey Taranov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The classical approach to the providing noise immunity and integrity of information that process in computing devices and communication channels is to use linear codes. Linear codes have fast and efficient algorithms of encoding and decoding information, but this codes concentrate their detect and correct abilities in certain error configurations. To protect against any configuration of errors at predetermined probability can robust codes. This is accomplished by the use of perfect nonlinear and almost perfect nonlinear functions to calculate the code redundancy. The paper presents the error-correcting coding scheme using biorthogonal wavelet transform. Wavelet transform applied in various fields of science. Some of the wavelet applications are cleaning of signal from noise, data compression, spectral analysis of the signal components. The article suggests methods for constructing linear codes based on wavelet decomposition. For developed constructions we build generator and check matrix that contain the scaling function coefficients of wavelet. Based on linear wavelet codes we develop robust codes that provide uniform protection against all errors. In article we propose two constructions of robust code. The first class of robust code is based on multiplicative inverse in finite field. In the second robust code construction the redundancy part is a cube of information part. Also, this paper investigates the characteristics of proposed robust and linear codes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=robust%20code" title="robust code">robust code</a>, <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=wavelet%20decomposition" title=" wavelet decomposition"> wavelet decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=scaling%20function" title=" scaling function"> scaling function</a>, <a href="https://publications.waset.org/abstracts/search?q=error%20masking%20probability" title=" error masking probability"> error masking probability</a> </p> <a href="https://publications.waset.org/abstracts/16512/constructions-of-linear-and-robust-codes-based-on-wavelet-decompositions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16512.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">489</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">2303</span> Method of False Alarm Rate Control for Cyclic Redundancy Check-Aided List Decoding of Polar Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dmitry%20Dikarev">Dmitry Dikarev</a>, <a href="https://publications.waset.org/abstracts/search?q=Ajit%20Nimbalker"> Ajit Nimbalker</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexei%20Davydov"> Alexei Davydov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Polar coding is a novel example of error correcting codes, which can achieve Shannon limit at block length N→∞ with log-linear complexity. Active research is being carried to adopt this theoretical concept for using in practical applications such as 5th generation wireless communication systems. Cyclic redundancy check (CRC) error detection code is broadly used in conjunction with successive cancellation list (SCL) decoding algorithm to improve finite-length polar code performance. However, there are two issues: increase of code block payload overhead by CRC bits and decrease of CRC error-detection capability. This paper proposes a method to control CRC overhead and false alarm rate of polar decoding. As shown in the computer simulations results, the proposed method provides the ability to use any set of CRC polynomials with any list size while maintaining the desired level of false alarm rate. This level of flexibility allows using polar codes in 5G New Radio standard. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=5G%20New%20Radio" title="5G New Radio">5G New Radio</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20coding" title=" channel coding"> channel coding</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclic%20redundancy%20check" title=" cyclic redundancy check"> cyclic redundancy check</a>, <a href="https://publications.waset.org/abstracts/search?q=list%20decoding" title=" list decoding"> list decoding</a>, <a href="https://publications.waset.org/abstracts/search?q=polar%20codes" title=" polar codes"> polar codes</a> </p> <a href="https://publications.waset.org/abstracts/85145/method-of-false-alarm-rate-control-for-cyclic-redundancy-check-aided-list-decoding-of-polar-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85145.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">238</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">2302</span> Texture Analysis of Grayscale Co-Occurrence Matrix on Mammographic Indexed Image</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Sushma">S. Sushma</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Balasubramanian"> S. Balasubramanian</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20C.%20Latha"> K. C. Latha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The mammographic image of breast cancer compressed and synthesized to get co-efficient values which will be converted (5x5) matrix to get ROI image where we get the highest value of effected region and with the same ideology the technique has been extended to differentiate between Calcification and normal cell image using mean value derived from 5x5 matrix values <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=texture%20analysis" title="texture analysis">texture analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=mammographic%20image" title=" mammographic image"> mammographic image</a>, <a href="https://publications.waset.org/abstracts/search?q=partitioned%20gray%20scale%20co-oocurance%20matrix" title=" partitioned gray scale co-oocurance matrix"> partitioned gray scale co-oocurance matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=co-efficient" title=" co-efficient "> co-efficient </a> </p> <a href="https://publications.waset.org/abstracts/17516/texture-analysis-of-grayscale-co-occurrence-matrix-on-mammographic-indexed-image" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17516.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">533</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">2301</span> Multiple Images Stitching Based on Gradually Changing Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shangdong%20Zhu">Shangdong Zhu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yunzhou%20Zhang"> Yunzhou Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jie%20Zhang"> Jie Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Hang%20Hu"> Hang Hu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yazhou%20Zhang"> Yazhou Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Image stitching is a very important branch in the field of computer vision, especially for panoramic map. In order to eliminate shape distortion, a novel stitching method is proposed based on gradually changing matrix when images are horizontal. For images captured horizontally, this paper assumes that there is only translational operation in image stitching. By analyzing each parameter of the homography matrix, the global homography matrix is gradually transferred to translation matrix so as to eliminate the effects of scaling, rotation, etc. in the image transformation. This paper adopts matrix approximation to get the minimum value of the energy function so that the shape distortion at those regions corresponding to the homography can be minimized. The proposed method can avoid multiple horizontal images stitching failure caused by accumulated shape distortion. At the same time, it can be combined with As-Projective-As-Possible algorithm to ensure precise alignment of overlapping area. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20stitching" title="image stitching">image stitching</a>, <a href="https://publications.waset.org/abstracts/search?q=gradually%20changing%20matrix" title=" gradually changing matrix"> gradually changing matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=horizontal%20direction" title=" horizontal direction"> horizontal direction</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20approximation" title=" matrix approximation"> matrix approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=homography%20matrix" title=" homography matrix"> homography matrix</a> </p> <a href="https://publications.waset.org/abstracts/85912/multiple-images-stitching-based-on-gradually-changing-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85912.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">319</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">2300</span> Matrix Method Posting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Varong%20Pongsai">Varong Pongsai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective of this paper is introducing a new method of accounting posting which is called Matrix Method Posting. This method is based on the Matrix operation of pure Mathematics. Although, accounting field is classified as one of the social-science knowledge, many of accounting operations are placed by Mathematics sign and operation. Through the operation applying, it seems to be that the operations of Mathematics should be applied to accounting possibly. So, this paper tries to over-lap Mathematics logic to accounting logic smoothly. According to the context of discovery, deductive approach is employed to prove a simultaneously logical concept of both Mathematics and Accounting. The result proves that the Matrix can be placed to operate accounting perfectly, because Matrix and accounting logic also have a similarity concept which is balancing 2 sides during operations. Moreover, the Matrix posting also has a lot of benefit. It can help financial analyst calculating financial ratios comfortably. Furthermore, the matrix determinant which is a signature operation itself also helps auditors checking out the correction of clients’ recording. If the determinant is not equaled to 0, it will point out that the recording process of clients getting into the problem. Finally, the Matrix should be easily determining a concept of merger and consolidation far beyond the present day concept. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matrix%20method%20posting" title="matrix method posting">matrix method posting</a>, <a href="https://publications.waset.org/abstracts/search?q=deductive%20approach" title=" deductive approach"> deductive approach</a>, <a href="https://publications.waset.org/abstracts/search?q=determinant" title=" determinant"> determinant</a>, <a href="https://publications.waset.org/abstracts/search?q=accounting%20application" title=" accounting application"> accounting application</a> </p> <a href="https://publications.waset.org/abstracts/31039/matrix-method-posting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31039.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">367</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=Redundancy%20Matrix&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix&page=77">77</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix&page=78">78</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix&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>