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: random oracle</title> <meta name="description" content="Search results for: random oracle"> <meta name="keywords" content="random oracle"> <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="random oracle" 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="random oracle"> <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> 2105</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: random oracle</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2105</span> Efficient Signcryption Scheme with Provable Security for Smart Card</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jayaprakash%20Kar">Jayaprakash Kar</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniyal%20M.%20Alghazzawi"> Daniyal M. Alghazzawi </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article proposes a novel construction of signcryption scheme with provable security which is most suited to implement on smart card. It is secure in random oracle model and the security relies on Decisional Bilinear Diffie-Hellmann Problem. The proposed scheme is secure against adaptive chosen ciphertext attack (indistiguishbility) and adaptive chosen message attack (unforgebility). Also, it is inspired by zero-knowledge proof. The two most important security goals for smart card are Confidentiality and authenticity. These functions are performed in one logical step in low computational cost. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=random%20oracle" title="random oracle">random oracle</a>, <a href="https://publications.waset.org/abstracts/search?q=provable%20security" title=" provable security"> provable security</a>, <a href="https://publications.waset.org/abstracts/search?q=unforgebility" title=" unforgebility"> unforgebility</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20card" title=" smart card"> smart card</a> </p> <a href="https://publications.waset.org/abstracts/17144/efficient-signcryption-scheme-with-provable-security-for-smart-card" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17144.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">593</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">2104</span> A Study of Blockchain Oracles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdeljalil%20Beniiche">Abdeljalil Beniiche</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The limitation with smart contracts is that they cannot access external data that might be required to control the execution of business logic. Oracles can be used to provide external data to smart contracts. An oracle is an interface that delivers data from external data outside the blockchain to a smart contract to consume. Oracle can deliver different types of data depending on the industry and requirements. In this paper, we study and describe the widely used blockchain oracles. Then, we elaborate on his potential role, technical architecture, and design patterns. Finally, we discuss the human oracle and its key role in solving the truth problem by reaching a consensus about a certain inquiry and tasks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=blockchain" title="blockchain">blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=oracles" title=" oracles"> oracles</a>, <a href="https://publications.waset.org/abstracts/search?q=oracles%20design" title=" oracles design"> oracles design</a>, <a href="https://publications.waset.org/abstracts/search?q=human%20oracles" title=" human oracles"> human oracles</a> </p> <a href="https://publications.waset.org/abstracts/133352/a-study-of-blockchain-oracles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133352.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">2103</span> End to End Monitoring in Oracle Fusion Middleware for Data Verification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Syed%20Kashif%20Ali">Syed Kashif Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Usman%20Javaid"> Usman Javaid</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20Chohan"> Abdullah Chohan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In large enterprises multiple departments use different sort of information systems and databases according to their needs. These systems are independent and heterogeneous in nature and sharing information/data between these systems is not an easy task. The usage of middleware technologies have made data sharing between systems very easy. However, monitoring the exchange of data/information for verification purposes between target and source systems is often complex or impossible for maintenance department due to security/access privileges on target and source systems. In this paper, we are intended to present our experience of an end to end data monitoring approach at middle ware level implemented in Oracle BPEL for data verification without any help of monitoring tool. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=service%20level%20agreement" title="service level agreement">service level agreement</a>, <a href="https://publications.waset.org/abstracts/search?q=SOA" title=" SOA"> SOA</a>, <a href="https://publications.waset.org/abstracts/search?q=BPEL" title=" BPEL"> BPEL</a>, <a href="https://publications.waset.org/abstracts/search?q=oracle%20fusion%20middleware" title=" oracle fusion middleware"> oracle fusion middleware</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20service%20monitoring" title=" web service monitoring"> web service monitoring</a> </p> <a href="https://publications.waset.org/abstracts/18853/end-to-end-monitoring-in-oracle-fusion-middleware-for-data-verification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18853.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">480</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">2102</span> Detailed Quantum Circuit Design and Evaluation of Grover's Algorithm for the Bounded Degree Traveling Salesman Problem Using the Q# Language</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wenjun%20Hou">Wenjun Hou</a>, <a href="https://publications.waset.org/abstracts/search?q=Marek%20Perkowski"> Marek Perkowski</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Traveling Salesman problem is famous in computing and graph theory. In short, it asks for the Hamiltonian cycle of the least total weight in a given graph with N nodes. All variations on this problem, such as those with K-bounded-degree nodes, are classified as NP-complete in classical computing. Although several papers propose theoretical high-level designs of quantum algorithms for the Traveling Salesman Problem, no quantum circuit implementation of these algorithms has been created up to our best knowledge. In contrast to previous papers, the goal of this paper is not to optimize some abstract complexity measures based on the number of oracle iterations, but to be able to evaluate the real circuit and time costs of the quantum computer. Using the emerging quantum programming language Q# developed by Microsoft, which runs quantum circuits in a quantum computer simulation, an implementation of the bounded-degree problem and its respective quantum circuit were created. To apply Grover’s algorithm to this problem, a quantum oracle was designed, evaluating the cost of a particular set of edges in the graph as well as its validity as a Hamiltonian cycle. Repeating the Grover algorithm with an oracle that finds successively lower cost each time allows to transform the decision problem to an optimization problem, finding the minimum cost of Hamiltonian cycles. N log₂ K qubits are put into an equiprobablistic superposition by applying the Hadamard gate on each qubit. Within these N log₂ K qubits, the method uses an encoding in which every node is mapped to a set of its encoded edges. The oracle consists of several blocks of circuits: a custom-written edge weight adder, node index calculator, uniqueness checker, and comparator, which were all created using only quantum Toffoli gates, including its special forms, which are Feynman and Pauli X. The oracle begins by using the edge encodings specified by the qubits to calculate each node that this path visits and adding up the edge weights along the way. Next, the oracle uses the calculated nodes from the previous step and check that all the nodes are unique. Finally, the oracle checks that the calculated cost is less than the previously-calculated cost. By performing the oracle an optimal number of times, a correct answer can be generated with very high probability. The oracle of the Grover Algorithm is modified using the recalculated minimum cost value, and this procedure is repeated until the cost cannot be further reduced. This algorithm and circuit design have been verified, using several datasets, to generate correct outputs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title="quantum computing">quantum computing</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20circuit%20optimization" title=" quantum circuit optimization"> quantum circuit optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms" title=" quantum algorithms"> quantum algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20quantum%20algorithms" title=" hybrid quantum algorithms"> hybrid quantum algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20programming" title=" quantum programming"> quantum programming</a>, <a href="https://publications.waset.org/abstracts/search?q=Grover%E2%80%99s%20algorithm" title=" Grover’s algorithm"> Grover’s algorithm</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=bounded-degree%20TSP" title=" bounded-degree TSP"> bounded-degree TSP</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal%20cost" title=" minimal cost"> minimal cost</a>, <a href="https://publications.waset.org/abstracts/search?q=Q%23%20language" title=" Q# language"> Q# language</a> </p> <a href="https://publications.waset.org/abstracts/111077/detailed-quantum-circuit-design-and-evaluation-of-grovers-algorithm-for-the-bounded-degree-traveling-salesman-problem-using-the-q-language" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/111077.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">190</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">2101</span> The Implementation of the Multi-Agent Classification System (MACS) in Compliance with FIPA Specifications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20R.%20Mhereeg">Mohamed R. Mhereeg</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper discusses the implementation of the MultiAgent classification System (MACS) and utilizing it to provide an automated and accurate classification of end users developing applications in the spreadsheet domain. However, different technologies have been brought together to build MACS. The strength of the system is the integration of the agent technology with the FIPA specifications together with other technologies, which are the .NET widows service based agents, the Windows Communication Foundation (WCF) services, the Service Oriented Architecture (SOA), and Oracle Data Mining (ODM). Microsoft's .NET windows service based agents were utilized to develop the monitoring agents of MACS, the .NET WCF services together with SOA approach allowed the distribution and communication between agents over the WWW. The Monitoring Agents (MAs) were configured to execute automatically to monitor excel spreadsheets development activities by content. Data gathered by the Monitoring Agents from various resources over a period of time was collected and filtered by a Database Updater Agent (DUA) residing in the .NET client application of the system. This agent then transfers and stores the data in Oracle server database via Oracle stored procedures for further processing that leads to the classification of the end user developers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=MACS" title="MACS">MACS</a>, <a href="https://publications.waset.org/abstracts/search?q=implementation" title=" implementation"> implementation</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-agent" title=" multi-agent"> multi-agent</a>, <a href="https://publications.waset.org/abstracts/search?q=SOA" title=" SOA"> SOA</a>, <a href="https://publications.waset.org/abstracts/search?q=autonomous" title=" autonomous"> autonomous</a>, <a href="https://publications.waset.org/abstracts/search?q=WCF" title=" WCF"> WCF</a> </p> <a href="https://publications.waset.org/abstracts/2528/the-implementation-of-the-multi-agent-classification-system-macs-in-compliance-with-fipa-specifications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2528.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">274</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">2100</span> Addressing the Oracle Problem: Decentralized Authentication in Blockchain-Based Green Hydrogen Certification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Volker%20Wannack">Volker Wannack</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this paper is to present a concept for addressing the Oracle Problem in the context of hydrogen production using renewable energy sources. The proposed approach relies on the authentication of the electricity used for hydrogen production by multiple surrounding actors with similar electricity generation facilities, which attest to the authenticity of the electricity production. The concept introduces an Authenticity Score assigned to each certificate, as well as a Trust Score assigned to each witness. Each certificate must be attested by different actors with a sufficient Trust Score to achieve an Authenticity Score above a predefined threshold, thereby demonstrating that the produced hydrogen is indeed "green." <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hydrogen" title="hydrogen">hydrogen</a>, <a href="https://publications.waset.org/abstracts/search?q=blockchain" title=" blockchain"> blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=sustainability" title=" sustainability"> sustainability</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20change" title=" structural change"> structural change</a> </p> <a href="https://publications.waset.org/abstracts/181604/addressing-the-oracle-problem-decentralized-authentication-in-blockchain-based-green-hydrogen-certification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/181604.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">64</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">2099</span> Stochastic Simulation of Random Numbers Using Linear Congruential Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Melvin%20Ballera">Melvin Ballera</a>, <a href="https://publications.waset.org/abstracts/search?q=Aldrich%20Olivar"> Aldrich Olivar</a>, <a href="https://publications.waset.org/abstracts/search?q=Mary%20Soriano"> Mary Soriano</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Digital computers nowadays must be able to have a utility that is capable of generating random numbers. Usually, computer-generated random numbers are not random given predefined values such as starting point and end points, making the sequence almost predictable. There are many applications of random numbers such business simulation, manufacturing, services domain, entertainment sector and other equally areas making worthwhile to design a unique method and to allow unpredictable random numbers. Applying stochastic simulation using linear congruential algorithm, it shows that as it increases the numbers of the seed and range the number randomly produced or selected by the computer becomes unique. If this implemented in an environment where random numbers are very much needed, the reliability of the random number is guaranteed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=stochastic%20simulation" title="stochastic simulation">stochastic simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20numbers" title=" random numbers"> random numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20congruential%20algorithm" title=" linear congruential algorithm"> linear congruential algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=pseudorandomness" title=" pseudorandomness"> pseudorandomness</a> </p> <a href="https://publications.waset.org/abstracts/52819/stochastic-simulation-of-random-numbers-using-linear-congruential-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52819.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">316</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">2098</span> Existence Result of Third Order Functional Random Integro-Differential Inclusion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20S.%20Palimkar">D. S. Palimkar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The FRIGDI (functional random integrodifferential inclusion) seems to be new and includes several known random differential inclusions already studied in the literature as special cases have been discussed in the literature for various aspects of the solutions. In this paper, we prove the existence result for FIGDI under the non-convex case of multi-valued function involved in it.Using random fixed point theorem of B. C. Dhage and caratheodory condition. This result is new to the theory of differential inclusion. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=caratheodory%20condition" title="caratheodory condition">caratheodory condition</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20differential%20inclusion" title=" random differential inclusion"> random differential inclusion</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20solution" title=" random solution"> random solution</a>, <a href="https://publications.waset.org/abstracts/search?q=integro-differential%20inclusion" title=" integro-differential inclusion"> integro-differential inclusion</a> </p> <a href="https://publications.waset.org/abstracts/34570/existence-result-of-third-order-functional-random-integro-differential-inclusion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34570.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">466</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2097</span> Existence Theory for First Order Functional Random Differential Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rajkumar%20N.%20Ingle">Rajkumar N. Ingle</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the existence of a solution of nonlinear functional random differential equations of the first order is proved under caratheodory condition. The study of the functional random differential equation has got importance in the random analysis of the dynamical systems of universal phenomena. Objectives: Nonlinear functional random differential equation is useful to the scientists, engineers, and mathematicians, who are engaged in N.F.R.D.E. analyzing a universal random phenomenon, govern by nonlinear random initial value problems of D.E. Applications of this in the theory of diffusion or heat conduction. Methodology: Using the concepts of probability theory, functional analysis, generally the existence theorems for the nonlinear F.R.D.E. are prove by using some tools such as fixed point theorem. The significance of the study: Our contribution will be the generalization of some well-known results in the theory of Nonlinear F.R.D.E.s. Further, it seems that our study will be useful to scientist, engineers, economists and mathematicians in their endeavors to analyses the nonlinear random problems of the universe in a better way. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Random%20Fixed%20Point%20Theorem" title="Random Fixed Point Theorem">Random Fixed Point Theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=functional%20random%20differential%20equation" title=" functional random differential equation"> functional random differential equation</a>, <a href="https://publications.waset.org/abstracts/search?q=N.F.R.D.E." title=" N.F.R.D.E."> N.F.R.D.E.</a>, <a href="https://publications.waset.org/abstracts/search?q=universal%20random%20phenomenon" title=" universal random phenomenon "> universal random phenomenon </a> </p> <a href="https://publications.waset.org/abstracts/28934/existence-theory-for-first-order-functional-random-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28934.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">501</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">2096</span> A Very Efficient Pseudo-Random Number Generator Based On Chaotic Maps and S-Box Tables</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Hamdi">M. Hamdi</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Rhouma"> R. Rhouma</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Belghith"> S. Belghith </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Generating random numbers are mainly used to create secret keys or random sequences. It can be carried out by various techniques. In this paper we present a very simple and efficient pseudo-random number generator (PRNG) based on chaotic maps and S-Box tables. This technique adopted two main operations one to generate chaotic values using two logistic maps and the second to transform them into binary words using random S-Box tables. The simulation analysis indicates that our PRNG possessing excellent statistical and cryptographic properties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Random%20Numbers" title="Random Numbers">Random Numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=Chaotic%20map" title=" Chaotic map"> Chaotic map</a>, <a href="https://publications.waset.org/abstracts/search?q=S-box" title=" S-box"> S-box</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20tests" title=" statistical tests"> statistical tests</a> </p> <a href="https://publications.waset.org/abstracts/21757/a-very-efficient-pseudo-random-number-generator-based-on-chaotic-maps-and-s-box-tables" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21757.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">365</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">2095</span> Heuristic to Generate Random X-Monotone Polygons</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kamaljit%20Pati">Kamaljit Pati</a>, <a href="https://publications.waset.org/abstracts/search?q=Manas%20Kumar%20Mohanty"> Manas Kumar Mohanty</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanjib%20Sadhu"> Sanjib Sadhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A heuristic has been designed to generate a random simple monotone polygon from a given set of ‘n’ points lying on a 2-Dimensional plane. Our heuristic generates a random monotone polygon in O(n) time after O(nℓogn) preprocessing time which is improved over the previous work where a random monotone polygon is produced in the same O(n) time but the preprocessing time is O(k) for n < k < n2. However, our heuristic does not generate all possible random polygons with uniform probability. The space complexity of our proposed heuristic is O(n). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sorting" title="sorting">sorting</a>, <a href="https://publications.waset.org/abstracts/search?q=monotone%20polygon" title=" monotone polygon"> monotone polygon</a>, <a href="https://publications.waset.org/abstracts/search?q=visibility" title=" visibility"> visibility</a>, <a href="https://publications.waset.org/abstracts/search?q=chain" title=" chain"> chain</a> </p> <a href="https://publications.waset.org/abstracts/19252/heuristic-to-generate-random-x-monotone-polygons" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19252.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">427</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">2094</span> Optimizing Skill Development in Golf Putting: An Investigation of Blocked, Random, and Increasing Practice Schedules</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=John%20White">John White</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study investigated the effects of practice schedules on learning and performance in golf putting, specifically focusing on the impact of increasing contextual interference (CI). University students (n=7) were randomly assigned to blocked, random, or increasing practice schedules. During acquisition, participants performed 135 putting trials using different weighted golf balls. The blocked group followed a specific sequence of ball weights, while the random group practiced with the balls in a random order. The increasing group started with a blocked schedule, transitioned to a serial schedule, and concluded with a random schedule. Retention and transfer tests were conducted 24 hours later. The results indicated that high levels of CI (random practice) were more beneficial for learning than low levels of CI (blocked practice). The increasing practice schedule, incorporating blocked, serial, and random practice, demonstrated advantages over traditional blocked and random schedules. Additionally, EEG was used to explore the neurophysiological effects of the increasing practice schedule. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=skill%20acquisition" title="skill acquisition">skill acquisition</a>, <a href="https://publications.waset.org/abstracts/search?q=motor%20control" title=" motor control"> motor control</a>, <a href="https://publications.waset.org/abstracts/search?q=learning" title=" learning"> learning</a>, <a href="https://publications.waset.org/abstracts/search?q=contextual%20interference" title=" contextual interference"> contextual interference</a> </p> <a href="https://publications.waset.org/abstracts/172538/optimizing-skill-development-in-golf-putting-an-investigation-of-blocked-random-and-increasing-practice-schedules" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/172538.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">96</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">2093</span> Determining Optimal Number of Trees in Random Forests</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Songul%20Cinaroglu">Songul Cinaroglu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Random Forest is an efficient, multi-class machine learning method using for classification, regression and other tasks. This method is operating by constructing each tree using different bootstrap sample of the data. Determining the number of trees in random forests is an open question in the literature for studies about improving classification performance of random forests. Aim: The aim of this study is to analyze whether there is an optimal number of trees in Random Forests and how performance of Random Forests differ according to increase in number of trees using sample health data sets in R programme. Method: In this study we analyzed the performance of Random Forests as the number of trees grows and doubling the number of trees at every iteration using “random forest” package in R programme. For determining minimum and optimal number of trees we performed Mc Nemar test and Area Under ROC Curve respectively. Results: At the end of the analysis it was found that as the number of trees grows, it does not always means that the performance of the forest is better than forests which have fever trees. In other words larger number of trees only increases computational costs but not increases performance results. Conclusion: Despite general practice in using random forests is to generate large number of trees for having high performance results, this study shows that increasing number of trees doesn’t always improves performance. Future studies can compare different kinds of data sets and different performance measures to test whether Random Forest performance results change as number of trees increase or not. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=classification%20methods" title="classification methods">classification methods</a>, <a href="https://publications.waset.org/abstracts/search?q=decision%20trees" title=" decision trees"> decision trees</a>, <a href="https://publications.waset.org/abstracts/search?q=number%20of%20trees" title=" number of trees"> number of trees</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20forest" title=" random forest"> random forest</a> </p> <a href="https://publications.waset.org/abstracts/30675/determining-optimal-number-of-trees-in-random-forests" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30675.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">395</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">2092</span> [Keynote Talk]: Existence of Random Fixed Point Theorem for Contractive Mappings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20S.%20Palimkar">D. S. Palimkar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Random fixed point theory has received much attention in recent years, and it is needed for the study of various classes of random equations. The study of random fixed point theorems was initiated by the Prague school of probabilistic in the 1950s. The existence and uniqueness of fixed points for the self-maps of a metric space by altering distances between the points with the use of a control function is an interesting aspect in the classical fixed point theory. In a new category of fixed point problems for a single self-map with the help of a control function that alters the distance between two points in a metric space which they called an altering distance function. In this paper, we prove the results of existence of random common fixed point and its uniqueness for a pair of random mappings under weakly contractive condition for generalizing alter distance function in polish spaces using Random Common Fixed Point Theorem for Generalized Weakly Contractions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Polish%20space" title="Polish space">Polish space</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20common%20fixed%20point%20theorem" title=" random common fixed point theorem"> random common fixed point theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=weakly%20contractive%20mapping" title=" weakly contractive mapping"> weakly contractive mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=altering%20function" title=" altering function"> altering function</a> </p> <a href="https://publications.waset.org/abstracts/79650/keynote-talk-existence-of-random-fixed-point-theorem-for-contractive-mappings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79650.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">273</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">2091</span> Parallel Random Number Generation for the Modern Supercomputer Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Roman%20Snytsar">Roman Snytsar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Pseudo-random numbers are often used in scientific computing such as the Monte Carlo Simulations or the Quantum Inspired Optimization. Requirements for a parallel random number generator running in the modern multi-core vector environment are more stringent than those for sequential random number generators. As well as passing the usual quality tests, the output of the parallel random number generator must be verifiable and reproducible throughout the concurrent execution. We propose a family of vectorized Permuted Congruential Generators. Implementations are available for multiple modern vector modern computer architectures. Besides demonstrating good single core performance, the generators scale easily across many processor cores and multiple distributed nodes. We provide performance and parallel speedup analysis and comparisons between the implementations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pseudo-random%20numbers" title="pseudo-random numbers">pseudo-random numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20optimization" title=" quantum optimization"> quantum optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=SIMD" title=" SIMD"> SIMD</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/152951/parallel-random-number-generation-for-the-modern-supercomputer-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152951.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">120</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">2090</span> Attitude Stabilization of Satellites Using Random Dither Quantization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kazuma%20Okada">Kazuma Okada</a>, <a href="https://publications.waset.org/abstracts/search?q=Tomoaki%20Hashimoto"> Tomoaki Hashimoto</a>, <a href="https://publications.waset.org/abstracts/search?q=Hirokazu%20Tahara"> Hirokazu Tahara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, the effectiveness of random dither quantization method for linear feedback control systems has been shown in several papers. However, the random dither quantization method has not yet been applied to nonlinear feedback control systems. The objective of this paper is to verify the effectiveness of random dither quantization method for nonlinear feedback control systems. For this purpose, we consider the attitude stabilization problem of satellites using discrete-level actuators. Namely, this paper provides a control method based on the random dither quantization method for stabilizing the attitude of satellites using discrete-level actuators. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantized%20control" title="quantized control">quantized control</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20systems" title=" nonlinear systems"> nonlinear systems</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20dither%20quantization" title=" random dither quantization"> random dither quantization</a> </p> <a href="https://publications.waset.org/abstracts/76853/attitude-stabilization-of-satellites-using-random-dither-quantization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76853.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">242</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">2089</span> An Efficient and Provably Secure Three-Factor Authentication Scheme with Key Agreement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohan%20Ramasundaram">Mohan Ramasundaram</a>, <a href="https://publications.waset.org/abstracts/search?q=Amutha%20Prabakar%20Muniyandi"> Amutha Prabakar Muniyandi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Remote user authentication is one of the important tasks for any kind of remote server applications. Several remote authentication schemes are proposed by the researcher for Telecare Medicine Information System (TMIS). Most of the existing techniques have limitations, vulnerable to various kind attacks, lack of functionalities, information leakage, no perfect forward security and ineffectiveness. Authentication is a process of user verification mechanism for allows him to access the resources of a server. Nowadays, most of the remote authentication protocols are using two-factor authentications. We have made a survey of several remote authentication schemes using three factors and this survey shows that the most of the schemes are inefficient and subject to several attacks. We observed from the experimental evaluation; the proposed scheme is very secure against various known attacks that include replay attack, man-in-the-middle attack. Furthermore, the analysis based on the communication cost and computational cost estimation of the proposed scheme with related schemes shows that our proposed scheme is efficient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Telecare%20Medicine%20Information%20System" title="Telecare Medicine Information System">Telecare Medicine Information System</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20cryptography" title=" elliptic curve cryptography"> elliptic curve cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=three-factor" title=" three-factor"> three-factor</a>, <a href="https://publications.waset.org/abstracts/search?q=biometric" title=" biometric"> biometric</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20oracle" title=" random oracle"> random oracle</a> </p> <a href="https://publications.waset.org/abstracts/91453/an-efficient-and-provably-secure-three-factor-authentication-scheme-with-key-agreement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/91453.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">219</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">2088</span> Asymptotic Spectral Theory for Nonlinear Random Fields</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karima%20Kimouche">Karima Kimouche</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider the asymptotic problems in spectral analysis of stationary causal random fields. We impose conditions only involving (conditional) moments, which are easily verifiable for a variety of nonlinear random fields. Limiting distributions of periodograms and smoothed periodogram spectral density estimates are obtained and applications to the spectral domain bootstrap are given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=spatial%20nonlinear%20processes" title="spatial nonlinear processes">spatial nonlinear processes</a>, <a href="https://publications.waset.org/abstracts/search?q=spectral%20estimators" title=" spectral estimators"> spectral estimators</a>, <a href="https://publications.waset.org/abstracts/search?q=GMC%20condition" title=" GMC condition"> GMC condition</a>, <a href="https://publications.waset.org/abstracts/search?q=bootstrap%20method" title=" bootstrap method"> bootstrap method</a> </p> <a href="https://publications.waset.org/abstracts/12479/asymptotic-spectral-theory-for-nonlinear-random-fields" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12479.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">451</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2087</span> Non-Universality in Barkhausen Noise Signatures of Thin Iron Films</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arnab%20Roy">Arnab Roy</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20S.%20Anil%20Kumar"> P. S. Anil Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We discuss angle dependent changes to the Barkhausen noise signatures of thin epitaxial Fe films upon altering the angle of the applied field. We observe a sub-critical to critical phase transition in the hysteresis loop of the sample upon increasing the out-of-plane component of the applied field. The observations are discussed in the light of simulations of a 2D Gaussian Random Field Ising Model with references to a reducible form of the Random Anisotropy Ising Model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Barkhausen%20noise" title="Barkhausen noise">Barkhausen noise</a>, <a href="https://publications.waset.org/abstracts/search?q=Planar%20Hall%20effect" title=" Planar Hall effect"> Planar Hall effect</a>, <a href="https://publications.waset.org/abstracts/search?q=Random%20Field%20Ising%20Model" title=" Random Field Ising Model"> Random Field Ising Model</a>, <a href="https://publications.waset.org/abstracts/search?q=Random%20Anisotropy%20Ising%20Model" title=" Random Anisotropy Ising Model"> Random Anisotropy Ising Model</a> </p> <a href="https://publications.waset.org/abstracts/17529/non-universality-in-barkhausen-noise-signatures-of-thin-iron-films" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17529.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">388</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">2086</span> Effect of Correlation of Random Variables on Structural Reliability Index</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Agnieszka%20Dudzik">Agnieszka Dudzik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problem of correlation between random variables in the structural reliability analysis has been extensively discussed in literature on the subject. The cases taken under consideration were usually related to correlation between random variables from one side of ultimate limit state: correlation between particular loads applied on structure or correlation between resistance of particular members of a structure as a system. It has been proved that positive correlation between these random variables reduces the reliability of structure and increases the probability of failure. In the paper, the problem of correlation between random variables from both side of the limit state equation will be taken under consideration. The simplest case where these random variables are of the normal distributions will be concerned. The case when a degree of that correlation is described by the covariance or the coefficient of correlation will be used. Special attention will be paid on questions: how much that correlation changes the reliability level and can it be ignored. In reliability analysis will be used well-known methods for assessment of the failure probability: based on the Hasofer-Lind reliability index and Monte Carlo method adapted to the problem of correlation. The main purpose of this work will be a presentation how correlation of random variables influence on reliability index of steel bar structures. Structural design parameters will be defined as deterministic values and random variables. The latter will be correlated. The criterion of structural failure will be expressed by limit functions related to the ultimate and serviceability limit state. In the description of random variables will be used only for the normal distribution. Sensitivity of reliability index to the random variables will be defined. If the reliability index sensitivity due to the random variable X will be low when compared with other variables, it can be stated that the impact of this variable on failure probability is small. Therefore, in successive computations, it can be treated as a deterministic parameter. Sensitivity analysis leads to simplify the description of the mathematical model, determine the new limit functions and values of the Hasofer-Lind reliability index. In the examples, the NUMPRESS software will be used in the reliability analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=correlation%20of%20random%20variables" title="correlation of random variables">correlation of random variables</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability%20index" title=" reliability index"> reliability index</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitivity%20of%20reliability%20index" title=" sensitivity of reliability index"> sensitivity of reliability index</a>, <a href="https://publications.waset.org/abstracts/search?q=steel%20structure" title=" steel structure"> steel structure</a> </p> <a href="https://publications.waset.org/abstracts/95343/effect-of-correlation-of-random-variables-on-structural-reliability-index" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95343.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">237</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">2085</span> Stabilization of Rotational Motion of Spacecrafts Using Quantized Two Torque Inputs Based on Random Dither</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yusuke%20Kuramitsu">Yusuke Kuramitsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Tomoaki%20Hashimoto"> Tomoaki Hashimoto</a>, <a href="https://publications.waset.org/abstracts/search?q=Hirokazu%20Tahara"> Hirokazu Tahara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The control problem of underactuated spacecrafts has attracted a considerable amount of interest. The control method for a spacecraft equipped with less than three control torques is useful when one of the three control torques had failed. On the other hand, the quantized control of systems is one of the important research topics in recent years. The random dither quantization method that transforms a given continuous signal to a discrete signal by adding artificial random noise to the continuous signal before quantization has also attracted a considerable amount of interest. The objective of this study is to develop the control method based on random dither quantization method for stabilizing the rotational motion of a rigid spacecraft with two control inputs. In this paper, the effectiveness of random dither quantization control method for the stabilization of rotational motion of spacecrafts with two torque inputs is verified by numerical simulations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=spacecraft%20control" title="spacecraft control">spacecraft control</a>, <a href="https://publications.waset.org/abstracts/search?q=quantized%20control" title=" quantized control"> quantized control</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20control" title=" nonlinear control"> nonlinear control</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20dither%20method" title=" random dither method"> random dither method</a> </p> <a href="https://publications.waset.org/abstracts/99540/stabilization-of-rotational-motion-of-spacecrafts-using-quantized-two-torque-inputs-based-on-random-dither" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99540.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">180</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">2084</span> Random Forest Classification for Population Segmentation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Regina%20Chua">Regina Chua</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To reduce the costs of re-fielding a large survey, a Random Forest classifier was applied to measure the accuracy of classifying individuals into their assigned segments with the fewest possible questions. Given a long survey, one needed to determine the most predictive ten or fewer questions that would accurately assign new individuals to custom segments. Furthermore, the solution needed to be quick in its classification and usable in non-Python environments. In this paper, a supervised Random Forest classifier was modeled on a dataset with 7,000 individuals, 60 questions, and 254 features. The Random Forest consisted of an iterative collection of individual decision trees that result in a predicted segment with robust precision and recall scores compared to a single tree. A random 70-30 stratified sampling for training the algorithm was used, and accuracy trade-offs at different depths for each segment were identified. Ultimately, the Random Forest classifier performed at 87% accuracy at a depth of 10 with 20 instead of 254 features and 10 instead of 60 questions. With an acceptable accuracy in prioritizing feature selection, new tools were developed for non-Python environments: a worksheet with a formulaic version of the algorithm and an embedded function to predict the segment of an individual in real-time. Random Forest was determined to be an optimal classification model by its feature selection, performance, processing speed, and flexible application in other environments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title="machine learning">machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=supervised%20learning" title=" supervised learning"> supervised learning</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20science" title=" data science"> data science</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20forest" title=" random forest"> random forest</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification"> classification</a>, <a href="https://publications.waset.org/abstracts/search?q=prediction" title=" prediction"> prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=predictive%20modeling" title=" predictive modeling"> predictive modeling</a> </p> <a href="https://publications.waset.org/abstracts/154919/random-forest-classification-for-population-segmentation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154919.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">94</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">2083</span> Statistical Characteristics of Distribution of Radiation-Induced Defects under Random Generation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20Selyshchev">P. Selyshchev</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider fluctuations of defects density taking into account their interaction. Stochastic field of displacement generation rate gives random defect distribution. We determinate statistical characteristics (mean and dispersion) of random field of point defect distribution as function of defect generation parameters, temperature and properties of irradiated crystal. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=irradiation" title="irradiation">irradiation</a>, <a href="https://publications.waset.org/abstracts/search?q=primary%20defects" title=" primary defects"> primary defects</a>, <a href="https://publications.waset.org/abstracts/search?q=interaction" title=" interaction"> interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=fluctuations" title=" fluctuations"> fluctuations</a> </p> <a href="https://publications.waset.org/abstracts/10105/statistical-characteristics-of-distribution-of-radiation-induced-defects-under-random-generation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10105.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">343</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2082</span> Generation of Symmetric Key Using Randomness of Hash Function</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sai%20Charan%20Kamana">Sai Charan Kamana</a>, <a href="https://publications.waset.org/abstracts/search?q=Harsha%20Vardhan%20Nakkina"> Harsha Vardhan Nakkina</a>, <a href="https://publications.waset.org/abstracts/search?q=B.R.%20Chandavarkar"> B.R. Chandavarkar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a highly secure and robust key generation process, a key role is played by randomness and random numbers when current real-world cryptosystems are observed. Most of the present-day cryptographic protocols depend upon the Random Number Generators (RNG), Pseudo-Random Number Generator (PRNG). These protocols often use noisy channels such as Disk seek time, CPU temperature, Mouse pointer movement, Fan noise to obtain true random values. Despite being cost-effective, these noisy channels may need additional hardware devices to continuously communicate with them. On the other hand, Hash functions are Pseudo-Random (because of their requirements). So, they are a good replacement for these noisy channels and have low hardware requirements. This paper discusses, some of the key generation methodologies, and their drawbacks. This paper explains how hash functions can be used in key generation, how to combine Key Derivation Functions with hash functions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=key%20derivation" title="key derivation">key derivation</a>, <a href="https://publications.waset.org/abstracts/search?q=hash%20based%20key%20derivation" title=" hash based key derivation"> hash based key derivation</a>, <a href="https://publications.waset.org/abstracts/search?q=password%20based%20key%20derivation" title=" password based key derivation"> password based key derivation</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20key%20derivation" title=" symmetric key derivation"> symmetric key derivation</a> </p> <a href="https://publications.waset.org/abstracts/128053/generation-of-symmetric-key-using-randomness-of-hash-function" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128053.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">161</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">2081</span> Estimation of Population Mean under Random Non-Response in Two-Phase Successive Sampling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Khalid">M. Khalid</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20N.%20Singh"> G. N. Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have considered the problem of estimation for population mean, on current (second) occasion in the presence of random non response in two-occasion successive sampling under two phase set-up. Modified exponential type estimators have been proposed, and their properties are studied under the assumptions that numbers of sampling units follow a distribution due to random non response situations. The performances of the proposed estimators are compared with linear combinations of two estimators, (a) sample mean estimator for fresh sample and (b) ratio estimator for matched sample under the complete response situations. Results are demonstrated through empirical studies which present the effectiveness of the proposed estimators. Suitable recommendations have been made to the survey practitioners. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=successive%20sampling" title="successive sampling">successive sampling</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20non-response" title=" random non-response"> random non-response</a>, <a href="https://publications.waset.org/abstracts/search?q=auxiliary%20variable" title=" auxiliary variable"> auxiliary variable</a>, <a href="https://publications.waset.org/abstracts/search?q=bias" title=" bias"> bias</a>, <a href="https://publications.waset.org/abstracts/search?q=mean%20square%20error" title=" mean square error"> mean square error</a> </p> <a href="https://publications.waset.org/abstracts/78773/estimation-of-population-mean-under-random-non-response-in-two-phase-successive-sampling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78773.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">521</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">2080</span> Spatially Random Sampling for Retail Food Risk Factors Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Guilan%20Huang">Guilan Huang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In 2013 and 2014, the U.S. Food and Drug Administration (FDA) collected data from selected fast food restaurants and full service restaurants for tracking changes in the occurrence of foodborne illness risk factors. This paper discussed how we customized spatial random sampling method by considering financial position and availability of FDA resources, and how we enriched restaurants data with location. Location information of restaurants provides opportunity for quantitatively determining random sampling within non-government units (e.g.: 240 kilometers around each data-collector). Spatial analysis also could optimize data-collectors’ work plans and resource allocation. Spatial analytic and processing platform helped us handling the spatial random sampling challenges. Our method fits in FDA’s ability to pinpoint features of foodservice establishments, and reduced both time and expense on data collection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=geospatial%20technology" title="geospatial technology">geospatial technology</a>, <a href="https://publications.waset.org/abstracts/search?q=restaurant" title=" restaurant"> restaurant</a>, <a href="https://publications.waset.org/abstracts/search?q=retail%20food%20risk%20factor%20study" title=" retail food risk factor study"> retail food risk factor study</a>, <a href="https://publications.waset.org/abstracts/search?q=spatially%20random%20sampling" title=" spatially random sampling"> spatially random sampling</a> </p> <a href="https://publications.waset.org/abstracts/48950/spatially-random-sampling-for-retail-food-risk-factors-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48950.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">2079</span> TRNG Based Key Generation for Certificateless Signcryption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.Balaji">S.Balaji</a>, <a href="https://publications.waset.org/abstracts/search?q=R.Sujatha"> R.Sujatha</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Ramakrishnan"> M. Ramakrishnan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Signcryption is a cryptographic primitive that fulfills both the functions of digital signature and public key encryption simultaneously in low cost when compared with the traditional signature-then-encryption approach. In this paper, we propose a novel mouse movement based key generation technique to generate secret keys which is secure against the outer and insider attacks. Tag Key Encapsulation Mechanism (KEM) process is implemented using True Random Number Generator (TRNG) method. This TRNG based key is used for data encryption in the Data Encapsulation Mechanism (DEM). We compare the statistical reports of the proposed system with the previous methods which implements TKEM based on pseudo random number generator <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pseudo%20random%20umber%20generator" title="pseudo random umber generator">pseudo random umber generator</a>, <a href="https://publications.waset.org/abstracts/search?q=signcryption" title=" signcryption"> signcryption</a>, <a href="https://publications.waset.org/abstracts/search?q=true%20random%20number%20generator" title=" true random number generator"> true random number generator</a>, <a href="https://publications.waset.org/abstracts/search?q=node%20deployment" title=" node deployment"> node deployment</a> </p> <a href="https://publications.waset.org/abstracts/15844/trng-based-key-generation-for-certificateless-signcryption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15844.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">341</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">2078</span> Numerical Simulations on Feasibility of Stochastic Model Predictive Control for Linear Discrete-Time Systems with Random Dither Quantization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Taiki%20Baba">Taiki Baba</a>, <a href="https://publications.waset.org/abstracts/search?q=Tomoaki%20Hashimoto"> Tomoaki Hashimoto</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The random dither quantization method enables us to achieve much better performance than the simple uniform quantization method for the design of quantized control systems. Motivated by this fact, the stochastic model predictive control method in which a performance index is minimized subject to probabilistic constraints imposed on the state variables of systems has been proposed for linear feedback control systems with random dither quantization. In other words, a method for solving optimal control problems subject to probabilistic state constraints for linear discrete-time control systems with random dither quantization has been already established. To our best knowledge, however, the feasibility of such a kind of optimal control problems has not yet been studied. Our objective in this paper is to investigate the feasibility of stochastic model predictive control problems for linear discrete-time control systems with random dither quantization. To this end, we provide the results of numerical simulations that verify the feasibility of stochastic model predictive control problems for linear discrete-time control systems with random dither quantization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=model%20predictive%20control" title="model predictive control">model predictive control</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20systems" title=" stochastic systems"> stochastic systems</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20constraints" title=" probabilistic constraints"> probabilistic constraints</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20dither%20quantization" title=" random dither quantization"> random dither quantization</a> </p> <a href="https://publications.waset.org/abstracts/78538/numerical-simulations-on-feasibility-of-stochastic-model-predictive-control-for-linear-discrete-time-systems-with-random-dither-quantization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78538.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">282</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">2077</span> Estimation of Population Mean under Random Non-Response in Two-Occasion Successive Sampling </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Khalid">M. Khalid</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20N.%20Singh"> G. N. Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have considered the problems of estimation for the population mean on current (second) occasion in two-occasion successive sampling under random non-response situations. Some modified exponential type estimators have been proposed and their properties are studied under the assumptions that the number of sampling unit follows a discrete distribution due to random non-response situations. The performances of the proposed estimators are compared with linear combinations of two estimators, (a) sample mean estimator for fresh sample and (b) ratio estimator for matched sample under the complete response situations. Results are demonstrated through empirical studies which present the effectiveness of the proposed estimators. Suitable recommendations have been made to the survey practitioners. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=modified%20exponential%20estimator" title="modified exponential estimator">modified exponential estimator</a>, <a href="https://publications.waset.org/abstracts/search?q=successive%20sampling" title=" successive sampling"> successive sampling</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20non-response" title=" random non-response"> random non-response</a>, <a href="https://publications.waset.org/abstracts/search?q=auxiliary%20variable" title=" auxiliary variable"> auxiliary variable</a>, <a href="https://publications.waset.org/abstracts/search?q=bias" title=" bias"> bias</a>, <a href="https://publications.waset.org/abstracts/search?q=mean%20square%20error" title=" mean square error"> mean square error</a> </p> <a href="https://publications.waset.org/abstracts/85408/estimation-of-population-mean-under-random-non-response-in-two-occasion-successive-sampling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85408.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">349</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2076</span> Numerical Study of Natural Convection Heat Transfer Performance in an Inclined Cavity: Nanofluid and Random Temperature</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hicham%20Salhi">Hicham Salhi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Si-Ameur"> Mohamed Si-Ameur</a>, <a href="https://publications.waset.org/abstracts/search?q=Nadjib%20Chafai"> Nadjib Chafai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Natural convection of a nanofluid consisting of water and nanoparticles (Ag or TiO2) in an inclined enclosure cavity, has been studied numerically, heated by a (random temperature, based on the random function). The governing equations are solved numerically using the finite-volume. Results are presented in the form of streamlines, isotherms, and average Nusselt number. In addition, a parametric study is carried out to examine explicitly the volume fraction effects of nanoparticles (Ψ= 0.1, 0.2), the Rayleigh number (Ra=103, 104, 105, 106),the inclination angle of the cavity( égale à 0°, 30°, 45°, 90°, 135°, 180°), types of temperature (constant ,random), types of (NF) (Ag andTiO2). The results reveal that (NPs) addition remarkably enhances heat transfer in the cavity especially for (Ψ= 0.2). Besides, the effect of inclination angle and type of temperature is more pronounced at higher Rayleigh number. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nanofluid" title="nanofluid">nanofluid</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20convection" title=" natural convection"> natural convection</a>, <a href="https://publications.waset.org/abstracts/search?q=inclined%20cavity" title=" inclined cavity"> inclined cavity</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20temperature" title=" random temperature"> random temperature</a>, <a href="https://publications.waset.org/abstracts/search?q=finite-volume" title=" finite-volume"> finite-volume</a> </p> <a href="https://publications.waset.org/abstracts/45433/numerical-study-of-natural-convection-heat-transfer-performance-in-an-inclined-cavity-nanofluid-and-random-temperature" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45433.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">287</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=random%20oracle&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20oracle&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20oracle&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20oracle&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20oracle&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20oracle&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20oracle&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20oracle&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20oracle&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=random%20oracle&page=70">70</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20oracle&page=71">71</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20oracle&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>