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: optimal distinctiveness</title> <meta name="description" content="Search results for: optimal distinctiveness"> <meta name="keywords" content="optimal distinctiveness"> <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="optimal distinctiveness" 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="optimal distinctiveness"> <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> 3109</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: optimal distinctiveness</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3109</span> Conformity and Differentiation in CSR Practices on Capital Market Performance: Empirical Evidence from Stock Liquidity and Price Crash Risk</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jie%20Zhang">Jie Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Chaomin%20Zhang"> Chaomin Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jihua%20Zhang"> Jihua Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Haitong%20Li"> Haitong Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Using the theory of optimal distinctiveness, this study examines the effects of conformity and differentiation within corporate social responsibility (CSR) practices on capital market performance. Analysing data from Chinese A-share listed firms from 2007 to 2022, this paper demonstrates that when firms conform to the expected scope of CSR, such behaviour enhances investor attention and market acceptance, thereby boosting stock liquidity. Conversely, emphasising differentiation in CSR practices more effectively mitigates stock price crash risk by addressing principal–agent problems and decreasing information asymmetry. This paper also investigates how organisational and environmental factors moderate the relationship between conformity and differentiation in CSR practices and their impact on capital market performance. The results also show that the influence of conformity on stock liquidity is accentuated in smaller firms and environments with stringent legal oversight. By contrast, the benefits of differentiation in reducing stock price crash risk are amplified in firms with robust corporate governance and markets characterised by high uncertainty. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=corporate%20social%20responsibility" title="corporate social responsibility">corporate social responsibility</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20responsibility%20practices" title=" social responsibility practices"> social responsibility practices</a>, <a href="https://publications.waset.org/abstracts/search?q=capital%20market%20performance" title=" capital market performance"> capital market performance</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20distinctiveness" title=" optimal distinctiveness"> optimal distinctiveness</a> </p> <a href="https://publications.waset.org/abstracts/192548/conformity-and-differentiation-in-csr-practices-on-capital-market-performance-empirical-evidence-from-stock-liquidity-and-price-crash-risk" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192548.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">19</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">3108</span> Phenotypic Diversity of the Tomato Germplasm from the Lazio Region in Central Italy, with a Case Study on Molecular Distinctiveness</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Barbara%20Farinon">Barbara Farinon</a>, <a href="https://publications.waset.org/abstracts/search?q=Maurizio%20E.%20Picarella"> Maurizio E. Picarella</a>, <a href="https://publications.waset.org/abstracts/search?q=Lorenzo%20Mancini"> Lorenzo Mancini</a>, <a href="https://publications.waset.org/abstracts/search?q=Andrea%20Mazzucato"> Andrea Mazzucato</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Italy is notoriously a secondary center of diversification for cultivated tomatoes (Solanum lycopersicum L.). The study of phenotypic and genetic diversity in landrace collections is important for germplasm conservation and biodiversity protection. Here, we set up to study the germplasm collected in the region of Lazio in Central Italy with a focus on the distinctiveness among landraces and the attribution of membership to unnamed accessions. Our regional collection included 30 accessions belonging to six different locally recognized landraces and 21 unnamed accessions. All accessions were gathered in Lazio and belonged to the collection held at the Regional Agency for the Development and Innovation of Agriculture in Lazio (ARSIAL, in the application of the Regional Act n. 15/2000, funded by Lazio Rural Development Plan 2014 – 2020 Agro-environmental Measure, Action 10.2.1) and at the University of Tuscia. We included 13 control genotypes as references. The collection showed wide phenotypic variability for several traits, such as fruit weight (range 14-277 g), locule number (2-12), shape index (0.54-2.65), yield (0.24-3.08 kg/plant), and soluble solids (3.4-7.5 °B). A few landraces showed uncommon phenotypes, such as potato leaf, colorless fruit epidermis, or delayed ripening. Multivariate analysis of 25 cardinal phenotypic variables grouped the named varieties and allowed to assign of some of the unnamed to recognized groups. A case study for distinctiveness is presented for the flattened-ribbed types that presented overlapping distribution according to the phenotypic data. Molecular markers retrieved by previous studies revealed differences compared to the phenotyping clustering, indicating that the named varieties “Scatolone di Bolsena” and “Pantano Romanesco” belong to the Marmande group, together with the reference landrace from Tuscany “Costoluto Fiorentino”. Differently, the landrace “Spagnoletta di Formia e Gaeta” was clearly distinct from the former at the molecular level. Therefore, a genotypic analysis of the analyzed collection appears needed to better define the molecular distinctiveness among the flattened-ribbed accessions, as well as to properly attribute the membership group of the unnamed accessions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distinctiveness" title="distinctiveness">distinctiveness</a>, <a href="https://publications.waset.org/abstracts/search?q=flattened-ribbed%20fruits" title=" flattened-ribbed fruits"> flattened-ribbed fruits</a>, <a href="https://publications.waset.org/abstracts/search?q=regional%20landraces" title=" regional landraces"> regional landraces</a>, <a href="https://publications.waset.org/abstracts/search?q=tomato" title=" tomato"> tomato</a> </p> <a href="https://publications.waset.org/abstracts/146163/phenotypic-diversity-of-the-tomato-germplasm-from-the-lazio-region-in-central-italy-with-a-case-study-on-molecular-distinctiveness" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/146163.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">138</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">3107</span> Modeling Visual Memorability Assessment with Autoencoders Reveals Characteristics of Memorable Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elham%20Bagheri">Elham Bagheri</a>, <a href="https://publications.waset.org/abstracts/search?q=Yalda%20Mohsenzadeh"> Yalda Mohsenzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Image memorability refers to the phenomenon where certain images are more likely to be remembered by humans than others. It is a quantifiable and intrinsic attribute of an image. Understanding how visual perception and memory interact is important in both cognitive science and artificial intelligence. It reveals the complex processes that support human cognition and helps to improve machine learning algorithms by mimicking the brain's efficient data processing and storage mechanisms. To explore the computational underpinnings of image memorability, this study examines the relationship between an image's reconstruction error, distinctiveness in latent space, and its memorability score. A trained autoencoder is used to replicate human-like memorability assessment inspired by the visual memory game employed in memorability estimations. This study leverages a VGG-based autoencoder that is pre-trained on the vast ImageNet dataset, enabling it to recognize patterns and features that are common to a wide and diverse range of images. An empirical analysis is conducted using the MemCat dataset, which includes 10,000 images from five broad categories: animals, sports, food, landscapes, and vehicles, along with their corresponding memorability scores. The memorability score assigned to each image represents the probability of that image being remembered by participants after a single exposure. The autoencoder is finetuned for one epoch with a batch size of one, attempting to create a scenario similar to human memorability experiments where memorability is quantified by the likelihood of an image being remembered after being seen only once. The reconstruction error, which is quantified as the difference between the original and reconstructed images, serves as a measure of how well the autoencoder has learned to represent the data. The reconstruction error of each image, the error reduction, and its distinctiveness in latent space are calculated and correlated with the memorability score. Distinctiveness is measured as the Euclidean distance between each image's latent representation and its nearest neighbor within the autoencoder's latent space. Different structural and perceptual loss functions are considered to quantify the reconstruction error. The results indicate that there is a strong correlation between the reconstruction error and the distinctiveness of images and their memorability scores. This suggests that images with more unique distinct features that challenge the autoencoder's compressive capacities are inherently more memorable. There is also a negative correlation between the reduction in reconstruction error compared to the autoencoder pre-trained on ImageNet, which suggests that highly memorable images are harder to reconstruct, probably due to having features that are more difficult to learn by the autoencoder. These insights suggest a new pathway for evaluating image memorability, which could potentially impact industries reliant on visual content and mark a step forward in merging the fields of artificial intelligence and cognitive science. The current research opens avenues for utilizing neural representations as instruments for understanding and predicting visual memory. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autoencoder" title="autoencoder">autoencoder</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20vision" title=" computational vision"> computational vision</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20memorability" title=" image memorability"> image memorability</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20reconstruction" title=" image reconstruction"> image reconstruction</a>, <a href="https://publications.waset.org/abstracts/search?q=memory%20retention" title=" memory retention"> memory retention</a>, <a href="https://publications.waset.org/abstracts/search?q=reconstruction%20error" title=" reconstruction error"> reconstruction error</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20perception" title=" visual perception"> visual perception</a> </p> <a href="https://publications.waset.org/abstracts/175805/modeling-visual-memorability-assessment-with-autoencoders-reveals-characteristics-of-memorable-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/175805.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">90</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">3106</span> Toward a Characteristic Optimal Power Flow Model for Temporal Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zongjie%20Wang">Zongjie Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhizhong%20Guo"> Zhizhong Guo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> While the regular optimal power flow model focuses on a single time scan, the optimization of power systems is typically intended for a time duration with respect to a desired objective function. In this paper, a temporal optimal power flow model for a time period is proposed. To reduce the computation burden needed for calculating temporal optimal power flow, a characteristic optimal power flow model is proposed, which employs different characteristic load patterns to represent the objective function and security constraints. A numerical method based on the interior point method is also proposed for solving the characteristic optimal power flow model. Both the temporal optimal power flow model and characteristic optimal power flow model can improve the systems’ desired objective function for the entire time period. Numerical studies are conducted on the IEEE 14 and 118-bus test systems to demonstrate the effectiveness of the proposed characteristic optimal power flow model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20power%20flow" title="optimal power flow">optimal power flow</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20period" title=" time period"> time period</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/abstracts/search?q=economy" title=" economy"> economy</a> </p> <a href="https://publications.waset.org/abstracts/61552/toward-a-characteristic-optimal-power-flow-model-for-temporal-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61552.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">3105</span> Optimal Management of Internal Capital of Company</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Sadallah">S. Sadallah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, dynamic programming is used to determine the optimal management of financial resources in company. Solution of the problem by consider into simpler substructures is constructed. The optimal management of internal capital of company are simulated. The tools applied in this development are based on graph theory. The software of given problems is built by using greedy algorithm. The obtained model and program maintenance enable us to define the optimal version of management of proper financial flows by using visual diagram on each level of investment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=management" title="management">management</a>, <a href="https://publications.waset.org/abstracts/search?q=software" title=" software"> software</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal" title=" optimal"> optimal</a>, <a href="https://publications.waset.org/abstracts/search?q=greedy%20algorithm" title=" greedy algorithm"> greedy algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=graph-diagram" title=" graph-diagram"> graph-diagram</a> </p> <a href="https://publications.waset.org/abstracts/47406/optimal-management-of-internal-capital-of-company" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47406.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">285</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">3104</span> Synchronization of Chaotic T-System via Optimal Control as an Adaptive Controller</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hossein%20Kheiri">Hossein Kheiri</a>, <a href="https://publications.waset.org/abstracts/search?q=Bashir%20Naderi"> Bashir Naderi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamad%20Reza%20Niknam"> Mohamad Reza Niknam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we study the optimal synchronization of chaotic T-system with complete uncertain parameter. Optimal control laws and parameter estimation rules are obtained by using Hamilton-Jacobi-Bellman (HJB) technique and Lyapunov stability theorem. The derived control laws are optimal adaptive control and make the states of drive and response systems asymptotically synchronized. Numerical simulation shows the effectiveness and feasibility of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lyapunov%20stability" title="Lyapunov stability">Lyapunov stability</a>, <a href="https://publications.waset.org/abstracts/search?q=synchronization" title=" synchronization"> synchronization</a>, <a href="https://publications.waset.org/abstracts/search?q=chaos" title=" chaos"> chaos</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title=" optimal control"> optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20control" title=" adaptive control"> adaptive control</a> </p> <a href="https://publications.waset.org/abstracts/8820/synchronization-of-chaotic-t-system-via-optimal-control-as-an-adaptive-controller" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8820.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">487</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">3103</span> Effect of Variable Fluxes on Optimal Flux Distribution in a Metabolic Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ehsan%20Motamedian">Ehsan Motamedian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Finding all optimal flux distributions of a metabolic model is an important challenge in systems biology. In this paper, a new algorithm is introduced to identify all alternate optimal solutions of a large scale metabolic network. The algorithm reduces the model to decrease computations for finding optimal solutions. The algorithm was implemented on the Escherichia coli metabolic model to find all optimal solutions for lactate and acetate production. There were more optimal flux distributions when acetate production was optimized. The model was reduced from 1076 to 80 variable fluxes for lactate while it was reduced to 91 variable fluxes for acetate. These 11 more variable fluxes resulted in about three times more optimal flux distributions. Variable fluxes were from 12 various metabolic pathways and most of them belonged to nucleotide salvage and extra cellular transport pathways. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flux%20variability" title="flux variability">flux variability</a>, <a href="https://publications.waset.org/abstracts/search?q=metabolic%20network" title=" metabolic network"> metabolic network</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-integer%20linear%20programming" title=" mixed-integer linear programming"> mixed-integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20optimal%20solutions" title=" multiple optimal solutions"> multiple optimal solutions</a> </p> <a href="https://publications.waset.org/abstracts/15698/effect-of-variable-fluxes-on-optimal-flux-distribution-in-a-metabolic-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15698.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">434</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">3102</span> On the Analysis of Strategies of Buechi Games</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Termimi%20Ab%20Ghani">Ahmad Termimi Ab Ghani</a>, <a href="https://publications.waset.org/abstracts/search?q=Kojiro%20Higuchi"> Kojiro Higuchi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present some results of simultaneous infinite games. We mainly work with generalized reachability games and Buechi games. These games are two-player concurrent games where each player chooses simultaneously their moves at each step. Our goal is to give simple expressions of values for each game. Moreover, we are interested in the question of what type of optimal (ε-optimal) strategy exists for both players depending on the type of games. We first show the determinacy (optimal value) and optimal (ε-optimal) strategies in generalized reachability games. We provide a simple expressions of value of this game and prove the existence of memoryless randomized ε-optimal strategy for Player I in any generalized reachability games. We then observe games with more complex objectives, games with Buechi objectives. We present how to compute an ε-optimal strategies and approximate a value of game in some way. Specifically, the results of generalized reachability games are used to show the value of Buechi games can be approximated as values of some generalized reachability games. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20Strategies" title="optimal Strategies">optimal Strategies</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20reachability%20games" title=" generalized reachability games"> generalized reachability games</a>, <a href="https://publications.waset.org/abstracts/search?q=Buechi%20games" title=" Buechi games"> Buechi games</a> </p> <a href="https://publications.waset.org/abstracts/23287/on-the-analysis-of-strategies-of-buechi-games" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23287.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">3101</span> Operations Research Applications in Audit Planning and Scheduling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdel-Aziz%20M.%20Mohamed">Abdel-Aziz M. Mohamed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a state-of-the-art survey of the operations research models developed for internal audit planning. Two alternative approaches have been followed in the literature for audit planning: (1) identifying the optimal audit frequency; and (2) determining the optimal audit resource allocation. The first approach identifies the elapsed time between two successive audits, which can be presented as the optimal number of audits in a given planning horizon, or the optimal number of transactions after which an audit should be performed. It also includes the optimal audit schedule. The second approach determines the optimal allocation of audit frequency among all auditable units in the firm. In our review, we discuss both the deterministic and probabilistic models developed for audit planning. In addition, game theory models are reviewed to find the optimal auditing strategy based on the interactions between the auditors and the clients. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=operations%20research%20applications" title="operations research applications">operations research applications</a>, <a href="https://publications.waset.org/abstracts/search?q=audit%20frequency" title=" audit frequency"> audit frequency</a>, <a href="https://publications.waset.org/abstracts/search?q=audit-staff%20scheduling" title=" audit-staff scheduling"> audit-staff scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=audit%20planning" title=" audit planning"> audit planning</a> </p> <a href="https://publications.waset.org/abstracts/30968/operations-research-applications-in-audit-planning-and-scheduling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30968.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">815</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">3100</span> Optimal Scheduling for Energy Storage System Considering Reliability Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wook-Won%20Kim">Wook-Won Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Je-Seok%20Shin"> Je-Seok Shin</a>, <a href="https://publications.waset.org/abstracts/search?q=Jin-O%20Kim"> Jin-O Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper propose the method for optimal scheduling for battery energy storage system with reliability constraint of energy storage system in reliability aspect. The optimal scheduling problem is solved by dynamic programming with proposed transition matrix. Proposed optimal scheduling method guarantees the minimum fuel cost within specific reliability constraint. For evaluating proposed method, the timely capacity outage probability table (COPT) is used that is calculated by convolution of probability mass function of each generator. This study shows the result of optimal schedule of energy storage system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=energy%20storage%20system%20%28ESS%29" title="energy storage system (ESS)">energy storage system (ESS)</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20scheduling" title=" optimal scheduling"> optimal scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming" title=" dynamic programming"> dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability%20constraints" title=" reliability constraints"> reliability constraints</a> </p> <a href="https://publications.waset.org/abstracts/39373/optimal-scheduling-for-energy-storage-system-considering-reliability-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39373.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">406</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">3099</span> Optimal Control of DC Motor Using Linear Quadratic Regulator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Meetty%20Tomy">Meetty Tomy</a>, <a href="https://publications.waset.org/abstracts/search?q=Arxhana%20G%20Thosar"> Arxhana G Thosar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper provides the implementation of optimal control for an armature-controlled DC motor. The selection of error weighted Matrix and control weighted matrix in order to implement optimal control theory for improving the dynamic behavior of DC motor is presented. The closed loop performance of Armature controlled DC motor with derived linear optimal controller is then evaluated for the transient operating condition (starting). The result obtained from MATLAB is compared with that of PID controller and simple closed loop response of the motor. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title="optimal control">optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=DC%20motor" title=" DC motor"> DC motor</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20index" title=" performance index"> performance index</a>, <a href="https://publications.waset.org/abstracts/search?q=MATLAB" title=" MATLAB"> MATLAB</a> </p> <a href="https://publications.waset.org/abstracts/45943/optimal-control-of-dc-motor-using-linear-quadratic-regulator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45943.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">410</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">3098</span> Controlled Chemotherapy Strategy Applied to HIV Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shohel%20Ahmed">Shohel Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Md.%20Abdul%20Alim"> Md. Abdul Alim</a>, <a href="https://publications.waset.org/abstracts/search?q=Sumaiya%20Rahman"> Sumaiya Rahman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Optimal control can be helpful to test and compare different vaccination strategies of a certain disease. The mathematical model of HIV we consider here is a set of ordinary differential equations (ODEs) describing the interactions of CD4+T cells of the immune system with the human immunodeficiency virus (HIV). As an early treatment setting, we investigate an optimal chemotherapy strategy where control represents the percentage of effect the chemotherapy has on the system. The aim is to obtain a new optimal chemotherapeutic strategy where an isoperimetric constraint on the chemotherapy supply plays a crucial role. We outline the steps in formulating an optimal control problem, derive optimality conditions and demonstrate numerical results of an optimal control for the model. Numerical results illustrate how such a constraint alters the optimal vaccination schedule and its effect on cell-virus interactions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chemotherapy%20of%20HIV" title="chemotherapy of HIV">chemotherapy of HIV</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control%20involving%20ODEs" title=" optimal control involving ODEs"> optimal control involving ODEs</a>, <a href="https://publications.waset.org/abstracts/search?q=optimality%20conditions" title=" optimality conditions"> optimality conditions</a>, <a href="https://publications.waset.org/abstracts/search?q=Pontryagin%E2%80%99s%20maximum%20principle" title=" Pontryagin’s maximum principle"> Pontryagin’s maximum principle</a> </p> <a href="https://publications.waset.org/abstracts/65162/controlled-chemotherapy-strategy-applied-to-hiv-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65162.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">330</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">3097</span> Portfolio Selection with Constraints on Trading Frequency</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Min%20Dai">Min Dai</a>, <a href="https://publications.waset.org/abstracts/search?q=Hong%20Liu"> Hong Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Shuaijie%20Qian"> Shuaijie Qian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study a portfolio selection problem of an investor who faces constraints on rebalancing frequency, which is common in pension fund investment. We formulate it as a multiple optimal stopping problem and utilize the dynamic programming principle. By numerically solving the corresponding Hamilton-Jacobi-Bellman (HJB) equation, we find a series of free boundaries characterizing optimal strategy, and the constraints significantly impact the optimal strategy. Even in the absence of transaction costs, there is a no-trading region, depending on the number of the remaining trading chances. We also find that the equivalent wealth loss caused by the constraints is large. In conclusion, our model clarifies the impact of the constraints on transaction frequency on the optimal strategy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=portfolio%20selection" title="portfolio selection">portfolio selection</a>, <a href="https://publications.waset.org/abstracts/search?q=rebalancing%20frequency" title=" rebalancing frequency"> rebalancing frequency</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20strategy" title=" optimal strategy"> optimal strategy</a>, <a href="https://publications.waset.org/abstracts/search?q=free%20boundary" title=" free boundary"> free boundary</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20stopping" title=" optimal stopping"> optimal stopping</a> </p> <a href="https://publications.waset.org/abstracts/171745/portfolio-selection-with-constraints-on-trading-frequency" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/171745.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">88</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">3096</span> Experimental Investigation on the Optimal Operating Frequency of a Thermoacoustic Refrigerator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kriengkrai%20Assawamartbunlue">Kriengkrai Assawamartbunlue</a>, <a href="https://publications.waset.org/abstracts/search?q=Channarong%20Wantha"> Channarong Wantha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the effects of the mean operating pressure on the optimal operating frequency based on temperature differences across stack ends in a thermoacoustic refrigerator. In addition to the length of the resonance tube, components of the thermoacoustic refrigerator have an influence on the operating frequency due to their acoustic properties, i.e. absorptivity, reflectivity and transmissivity. The interference of waves incurs and distorts the original frequency generated by the driver so that the optimal operating frequency differs from the designs. These acoustic properties are not parameters in the designs and it is very complicated to infer their responses. A prototype thermoacoustic refrigerator is constructed and used to investigate its optimal operating frequency compared to the design at various operating pressures. Helium and air are used as working fluids during the experiments. The results indicate that the optimal operating frequency of the prototype thermoacoustic refrigerator using helium is at 6 bar and 490Hz or approximately 20% away from the design frequency. The optimal operating frequency at other mean pressures differs from the design in an unpredictable manner, however, the optimal operating frequency and pressure can be identified by testing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=acoustic%20properties" title="acoustic properties">acoustic properties</a>, <a href="https://publications.waset.org/abstracts/search?q=Carnot%E2%80%99s%20efficiency" title=" Carnot’s efficiency"> Carnot’s efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=interference%20of%20waves" title=" interference of waves"> interference of waves</a>, <a href="https://publications.waset.org/abstracts/search?q=operating%20pressure" title=" operating pressure"> operating pressure</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20operating%20frequency" title=" optimal operating frequency"> optimal operating frequency</a>, <a href="https://publications.waset.org/abstracts/search?q=stack%20performance" title=" stack performance"> stack performance</a>, <a href="https://publications.waset.org/abstracts/search?q=standing%20wave" title=" standing wave"> standing wave</a>, <a href="https://publications.waset.org/abstracts/search?q=thermoacoustic%20refrigerator" title=" thermoacoustic refrigerator"> thermoacoustic refrigerator</a> </p> <a href="https://publications.waset.org/abstracts/23908/experimental-investigation-on-the-optimal-operating-frequency-of-a-thermoacoustic-refrigerator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23908.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">486</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">3095</span> Revisiting the Fiscal Theory of Sovereign Risk from the DSGE View</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eiji%20Okano">Eiji Okano</a>, <a href="https://publications.waset.org/abstracts/search?q=Kazuyuki%20Inagaki"> Kazuyuki Inagaki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We revisit Uribe's `Fiscal Theory of Sovereign Risk' advocating that there is a trade-off between stabilizing inflation and suppressing default. We develop a class of dynamic stochastic general equilibrium (DSGE) model with nominal rigidities and compare two de facto inflation stabilization policies, optimal monetary policy and optimal monetary and fiscal policy with the minimizing interest rate spread policy which completely suppress the default. Under the optimal monetary and fiscal policy, not only the nominal interest rate but also the tax rate work to minimize welfare costs through stabilizing inflation. Under the optimal monetary both inflation and output gap are completely stabilized although those are fluctuating under the optimal monetary policy. In addition, volatility in the default rate under the optimal monetary policy is considerably lower than one under the optimal monetary policy. Thus, there is not the SI-SD trade-off. In addition, while the minimizing interest rate spread policy makes inflation rate severely volatile, the optimal monetary and fiscal policy stabilize both the inflation and the default. A trade-off between stabilizing inflation and suppressing default is not so severe what pointed out by Uribe. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sovereign%20risk" title="sovereign risk">sovereign risk</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20monetary%20policy" title=" optimal monetary policy"> optimal monetary policy</a>, <a href="https://publications.waset.org/abstracts/search?q=fiscal%20theory%20of%20the%20price%20level" title=" fiscal theory of the price level"> fiscal theory of the price level</a>, <a href="https://publications.waset.org/abstracts/search?q=DSGE" title=" DSGE"> DSGE</a> </p> <a href="https://publications.waset.org/abstracts/50808/revisiting-the-fiscal-theory-of-sovereign-risk-from-the-dsge-view" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50808.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">321</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">3094</span> Optimized Algorithm for Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fuzhang%20Zhao">Fuzhang Zhao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Particle swarm optimization (PSO) is becoming one of the most important swarm intelligent paradigms for solving global optimization problems. Although some progress has been made to improve PSO algorithms over the last two decades, additional work is still needed to balance parameters to achieve better numerical properties of accuracy, efficiency, and stability. In the optimal PSO algorithm, the optimal weightings of (√ 5 − 1)/2 and (3 − √5)/2 are used for the cognitive factor and the social factor, respectively. By the same token, the same optimal weightings have been applied for intensification searches and diversification searches, respectively. Perturbation and constriction effects are optimally balanced. Simulations of the de Jong, the Rosenbrock, and the Griewank functions show that the optimal PSO algorithm indeed achieves better numerical properties and outperforms the canonical PSO algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=diversification%20search" title="diversification search">diversification search</a>, <a href="https://publications.waset.org/abstracts/search?q=intensification%20search" title=" intensification search"> intensification search</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20weighting" title=" optimal weighting"> optimal weighting</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a> </p> <a href="https://publications.waset.org/abstracts/36390/optimized-algorithm-for-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36390.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">581</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">3093</span> Condition Optimization for Trypsin and Chymotrypsin Activities in Economic Animals</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mallika%20Supa-Aksorn">Mallika Supa-Aksorn</a>, <a href="https://publications.waset.org/abstracts/search?q=Buaream%20Maneewan"> Buaream Maneewan</a>, <a href="https://publications.waset.org/abstracts/search?q=Jiraporn%20Rojtinnakorn"> Jiraporn Rojtinnakorn</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For animals, trypsin and chymotrypsin are the 2 proteases that play the important role in protein digestion and involving in growth rate. In many animals, these two enzymes are indicated as growth parameter by feed. Although enzyme assay at optimal condition is significant for its accuracy activity determination. There is less report of trypsin and chymotrypsin. Therefore, in this study, optimization of pH and temperature for trypsin (T) and chymotrypsin (C) in economic species; i.e. Nile tilapia (Oreochromis niloticus), sand goby (Oxyeleotoris marmoratus), giant freshwater prawn (Macrobachium rosenberchii) and native chicken (Gallus gallus) were investigated. Each enzyme of each species was assaying for its specific activity with variation of pH in range of 2-12 and temperature in range of 30-80 °C. It revealed that, for Nile tilapia, T had optimal condition at pH 9 and temperature 50-80 °C, whereas C had optimal condition at pH 8 and temperature 60 °C. For sand goby, T had optimal condition at pH 7 and temperature of 50 °C, while C had optimal condition at pH 11 and temperature of 70-75 °C. For juvenile freshwater prawn, T had optimal condition at pH 10-11 and temperature of 60-65 °C, C had optimal condition at pH 8 and temperature of 70°C. For starter native chicken, T has optimal condition at pH 7 and temperature of 70 °C, whereas C had o optimal condition at pH 8 and temperature of 60°C. This information of optimal conditions will be high valuable in further for, actual enzyme measurement of T and C activities that benefit for growth and feed analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=trypsin" title="trypsin">trypsin</a>, <a href="https://publications.waset.org/abstracts/search?q=chymotrypsin" title=" chymotrypsin"> chymotrypsin</a>, <a href="https://publications.waset.org/abstracts/search?q=Oreochromis%20niloticus" title=" Oreochromis niloticus"> Oreochromis niloticus</a>, <a href="https://publications.waset.org/abstracts/search?q=Oxyeleotoris%20marmoratus" title=" Oxyeleotoris marmoratus"> Oxyeleotoris marmoratus</a>, <a href="https://publications.waset.org/abstracts/search?q=Macrobachium%20rosenberchii" title=" Macrobachium rosenberchii"> Macrobachium rosenberchii</a>, <a href="https://publications.waset.org/abstracts/search?q=Gallus%20gallus" title=" Gallus gallus"> Gallus gallus</a> </p> <a href="https://publications.waset.org/abstracts/64899/condition-optimization-for-trypsin-and-chymotrypsin-activities-in-economic-animals" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64899.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">259</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">3092</span> Product Development in Company</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Giorgi%20Methodishvili">Giorgi Methodishvili</a>, <a href="https://publications.waset.org/abstracts/search?q=Iuliia%20Methodishvili"> Iuliia Methodishvili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper product development algorithm is used to determine the optimal management of financial resources in company. Aspects of financial management considered include put initial investment, examine all possible ways to solve the problem and the optimal rotation length of profit. The software of given problems is based using greedy algorithm. The obtained model and program maintenance enable us to define the optimal version of management of proper financial flows by using visual diagram on each level of investment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=management" title="management">management</a>, <a href="https://publications.waset.org/abstracts/search?q=software" title=" software"> software</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal" title=" optimal"> optimal</a>, <a href="https://publications.waset.org/abstracts/search?q=greedy%20algorithm" title=" greedy algorithm"> greedy algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=graph-diagram" title=" graph-diagram"> graph-diagram</a> </p> <a href="https://publications.waset.org/abstracts/182730/product-development-in-company" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/182730.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">56</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">3091</span> On the Construction of Some Optimal Binary Linear Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Skezeer%20John%20B.%20Paz">Skezeer John B. Paz</a>, <a href="https://publications.waset.org/abstracts/search?q=Ederlina%20G.%20Nocon"> Ederlina G. Nocon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C = [n, k, d] is called optimal if there is no linear code with higher minimum distance d given the length n and the dimension k. There are bounds giving limits for the minimum distance d of a linear code of fixed length n and dimension k. The lower bound which can be taken by construction process tells that there is a known linear code having this minimum distance. The upper bound is given by theoretic results such as Griesmer bound. One way to find an optimal binary linear code is to make the lower bound of d equal to its higher bound. That is, to construct a binary linear code which achieves the highest possible value of its minimum distance d, given n and k. Some optimal binary linear codes were presented by Andries Brouwer in his published table on bounds of the minimum distance d of binary linear codes for 1 ≤ n ≤ 256 and k ≤ n. This was further improved by Markus Grassl by giving a detailed construction process for each code exhibiting the lower bound. In this paper, we construct new optimal binary linear codes by using some construction processes on existing binary linear codes. Particularly, we developed an algorithm applied to the codes already constructed to extend the list of optimal binary linear codes up to 257 ≤ n ≤ 300 for k ≤ 7. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes" title="bounds of linear codes">bounds of linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=Griesmer%20bound" title=" Griesmer bound"> Griesmer bound</a>, <a href="https://publications.waset.org/abstracts/search?q=construction%20of%20linear%20codes" title=" construction of linear codes"> construction of linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20binary%20linear%20codes" title=" optimal binary linear codes"> optimal binary linear codes</a> </p> <a href="https://publications.waset.org/abstracts/31628/on-the-construction-of-some-optimal-binary-linear-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31628.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">755</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">3090</span> Optimal Bayesian Chart for Controlling Expected Number of Defects in Production Processes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=V.%20Makis">V. Makis</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20Jafari"> L. Jafari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we develop an optimal Bayesian chart to control the expected number of defects per inspection unit in production processes with long production runs. We formulate this control problem in the optimal stopping framework. The objective is to determine the optimal stopping rule minimizing the long-run expected average cost per unit time considering partial information obtained from the process sampling at regular epochs. We prove the optimality of the control limit policy, i.e., the process is stopped and the search for assignable causes is initiated when the posterior probability that the process is out of control exceeds a control limit. An algorithm in the semi-Markov decision process framework is developed to calculate the optimal control limit and the corresponding average cost. Numerical examples are presented to illustrate the developed optimal control chart and to compare it with the traditional u-chart. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bayesian%20u-chart" title="Bayesian u-chart">Bayesian u-chart</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20design" title=" economic design"> economic design</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20stopping" title=" optimal stopping"> optimal stopping</a>, <a href="https://publications.waset.org/abstracts/search?q=semi-Markov%20decision%20process" title=" semi-Markov decision process"> semi-Markov decision process</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20process%20control" title=" statistical process control"> statistical process control</a> </p> <a href="https://publications.waset.org/abstracts/62841/optimal-bayesian-chart-for-controlling-expected-number-of-defects-in-production-processes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62841.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">573</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">3089</span> Optimal Bayesian Control of the Proportion of Defectives in a Manufacturing Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Viliam%20Makis">Viliam Makis</a>, <a href="https://publications.waset.org/abstracts/search?q=Farnoosh%20Naderkhani"> Farnoosh Naderkhani</a>, <a href="https://publications.waset.org/abstracts/search?q=Leila%20Jafari"> Leila Jafari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a model and an algorithm for the calculation of the optimal control limit, average cost, sample size, and the sampling interval for an optimal Bayesian chart to control the proportion of defective items produced using a semi-Markov decision process approach. Traditional p-chart has been widely used for controlling the proportion of defectives in various kinds of production processes for many years. It is well known that traditional non-Bayesian charts are not optimal, but very few optimal Bayesian control charts have been developed in the literature, mostly considering finite horizon. The objective of this paper is to develop a fast computational algorithm to obtain the optimal parameters of a Bayesian p-chart. The decision problem is formulated in the partially observable framework and the developed algorithm is illustrated by a numerical example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bayesian%20control%20chart" title="Bayesian control chart">Bayesian control chart</a>, <a href="https://publications.waset.org/abstracts/search?q=semi-Markov%20decision%20process" title=" semi-Markov decision process"> semi-Markov decision process</a>, <a href="https://publications.waset.org/abstracts/search?q=quality%20control" title=" quality control"> quality control</a>, <a href="https://publications.waset.org/abstracts/search?q=partially%20observable%20process" title=" partially observable process"> partially observable process</a> </p> <a href="https://publications.waset.org/abstracts/49751/optimal-bayesian-control-of-the-proportion-of-defectives-in-a-manufacturing-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49751.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">318</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">3088</span> A Study on the Optimal Placement and Control Scheme for Multi Terminal HVDC in Korea</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chur%20Hee%20Lee">Chur Hee Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Ju%20Sik%20Kwak"> Ju Sik Kwak</a>, <a href="https://publications.waset.org/abstracts/search?q=Seung%20Wan%20Kim"> Seung Wan Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals about economics and control of optimal placement of multi-terminal HVDC in Korea. Currently, No.1 and 2 HVDC are installed in Jeju and Mainland, Dangjin Godeok HVDC starts operation in 2020. Jeju No.3 HVDC also starts operation in 2022. HVDC systems in Korea are expanding. Also, super grid projects with China, Japan, and Russia are under consideration. In this situation, it is necessary to study how to install optimal HVDC in Korea and how to control it. After initializing the Optical Polwer Flow (OPF) procudure using lossless economic dispatch, grobal iteration will be set. And then, this will be formed as the Lagrangian function and linearizied. We will also analyze the advantages and disadvantages of each operation mode for optimal operating conditions of voltage and current complex HVDC in Korea. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=economics" title="economics">economics</a>, <a href="https://publications.waset.org/abstracts/search?q=HVDC" title=" HVDC"> HVDC</a>, <a href="https://publications.waset.org/abstracts/search?q=multi%20terminal" title=" multi terminal"> multi terminal</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal" title=" optimal "> optimal </a> </p> <a href="https://publications.waset.org/abstracts/123317/a-study-on-the-optimal-placement-and-control-scheme-for-multi-terminal-hvdc-in-korea" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/123317.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">212</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">3087</span> Solutions to Probabilistic Constrained Optimal Control Problems Using Concentration Inequalities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tomoaki%20Hashimoto">Tomoaki Hashimoto</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, optimal control problems subject to probabilistic constraints have attracted much attention in many research field. Although probabilistic constraints are generally intractable in optimization problems, several methods haven been proposed to deal with probabilistic constraints. In most methods, probabilistic constraints are transformed to deterministic constraints that are tractable in optimization problems. This paper examines a method for transforming probabilistic constraints into deterministic constraints for a class of probabilistic constrained optimal control problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title="optimal control">optimal 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=discrete-time%20systems" title=" discrete-time systems"> discrete-time systems</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20constraints" title=" probabilistic constraints"> probabilistic constraints</a> </p> <a href="https://publications.waset.org/abstracts/57973/solutions-to-probabilistic-constrained-optimal-control-problems-using-concentration-inequalities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57973.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">278</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">3086</span> Designing Directed Network with Optimal Controllability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Liang%20Bai">Liang Bai</a>, <a href="https://publications.waset.org/abstracts/search?q=Yandong%20Xiao"> Yandong Xiao</a>, <a href="https://publications.waset.org/abstracts/search?q=Haorang%20Wang"> Haorang Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Songyang%20Lao"> Songyang Lao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The directedness of links is crucial to determine the controllability in complex networks. Even the edge directions can determine the controllability of complex networks. Obviously, for a given network, we wish to design its edge directions that make this network approach the optimal controllability. In this work, we firstly introduce two methods to enhance network by assigning edge directions. However, these two methods could not completely mitigate the negative effects of inaccessibility and dilations. Thus, to approach the optimal network controllability, the edge directions must mitigate the negative effects of inaccessibility and dilations as much as possible. Finally, we propose the edge direction for optimal controllability. The optimal method has been found to be successfully useful on real-world and synthetic networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=complex%20network" title="complex network">complex network</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamics" title=" dynamics"> dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20control" title=" network control"> network control</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/103008/designing-directed-network-with-optimal-controllability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103008.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">185</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">3085</span> Three-Dimensional Optimal Path Planning of a Flying Robot for Terrain Following/Terrain Avoidance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amirreza%20Kosari">Amirreza Kosari</a>, <a href="https://publications.waset.org/abstracts/search?q=Hossein%20Maghsoudi"> Hossein Maghsoudi</a>, <a href="https://publications.waset.org/abstracts/search?q=Malahat%20Givar"> Malahat Givar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, the three-dimensional optimal path planning of a flying robot for Terrain Following / Terrain Avoidance (TF/TA) purposes using Direct Collocation has been investigated. To this purpose, firstly, the appropriate equations of motion representing the flying robot translational movement have been described. The three-dimensional optimal path planning of the flying vehicle in terrain following/terrain avoidance maneuver is formulated as an optimal control problem. The terrain profile, as the main allowable height constraint has been modeled using Fractal Generation Method. The resulting optimal control problem is discretized by applying Direct Collocation numerical technique, and then transformed into a Nonlinear Programming Problem (NLP). The efficacy of the proposed method is demonstrated by extensive simulations, and in particular, it is verified that this approach could produce a solution satisfying almost all performance and environmental constraints encountering a low-level flying maneuver <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=path%20planning" title="path planning">path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=terrain%20following" title=" terrain following"> terrain following</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title=" optimal control"> optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming" title=" nonlinear programming"> nonlinear programming</a> </p> <a href="https://publications.waset.org/abstracts/98941/three-dimensional-optimal-path-planning-of-a-flying-robot-for-terrain-followingterrain-avoidance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98941.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">188</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">3084</span> An Inverse Optimal Control Approach for the Nonlinear System Design Using ANN</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20P.%20Nanda%20Kumar">M. P. Nanda Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Dheeraj"> K. Dheeraj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The design of a feedback controller, so as to minimize a given performance criterion, for a general non-linear dynamical system is difficult; if not impossible. But for a large class of non-linear dynamical systems, the open loop control that minimizes a performance criterion can be obtained using calculus of variations and Pontryagin’s minimum principle. In this paper, the open loop optimal trajectories, that minimizes a given performance measure, is used to train the neural network whose inputs are state variables of non-linear dynamical systems and the open loop optimal control as the desired output. This trained neural network is used as the feedback controller. In other words, attempts are made here to solve the “inverse optimal control problem” by using the state and control trajectories that are optimal in an open loop sense. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=inverse%20optimal%20control" title="inverse optimal control">inverse optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=radial%20basis%20function" title=" radial basis function"> radial basis function</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=controller%20design" title=" controller design"> controller design</a> </p> <a href="https://publications.waset.org/abstracts/9888/an-inverse-optimal-control-approach-for-the-nonlinear-system-design-using-ann" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9888.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">553</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">3083</span> Optimal Design of Profiled Steel Sheet for Composite Slab</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adinew%20Gebremeskel%20Tizazu">Adinew Gebremeskel Tizazu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, in our world of technological development, there is an enhanced intention imposed on the building construction industry to improve the time, economy, and structural efficiency of structures. Modern profiled steel sheets are mostly designed as formwork and tensile reinforcement. This research is concerned with the optimal design of profiled steel sheets for composite slabs. Apart from satisfying the safety requirement, the design should be economical. For a given condition, there might be a large number of alternatives that satisfy the requirement set by the codes. But the designer must be in a position to choose the design, which is optimal against certain measures of optimality. Therefore, the designers have to do some optimization to arrive at such a design. In this research, the optimal cross-sectional dimensions of profiled steel sheets will be determined by considering different spans, loadings, and materials. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=profiled%20sheeting" title="profiled sheeting">profiled sheeting</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20cross-sectional%20dimensions" title=" optimal cross-sectional dimensions"> optimal cross-sectional dimensions</a>, <a href="https://publications.waset.org/abstracts/search?q=cold-formed%20profiled%20sheets" title=" cold-formed profiled sheets"> cold-formed profiled sheets</a>, <a href="https://publications.waset.org/abstracts/search?q=composite%20slab" title=" composite slab"> composite slab</a> </p> <a href="https://publications.waset.org/abstracts/189307/optimal-design-of-profiled-steel-sheet-for-composite-slab" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/189307.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">23</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">3082</span> Optimal Location of the I/O Point in the Parking System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jing%20Zhang">Jing Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jie%20Chen"> Jie Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we deal with the optimal I/O point location in an automated parking system. In this system, the S/R machine (storage and retrieve machine) travels independently in vertical and horizontal directions. Based on the characteristics of the parking system and the basic principle of AS/RS system (Automated Storage and Retrieval System), we obtain the continuous model in units of time. For the single command cycle using the randomized storage policy, we calculate the probability density function for the system travel time and thus we develop the travel time model. And we confirm that the travel time model shows a good performance by comparing with discrete case. Finally in this part, we establish the optimal model by minimizing the expected travel time model and it is shown that the optimal location of the I/O point is located at the middle of the left-hand above corner. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parking%20system" title="parking system">parking system</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20location" title=" optimal location"> optimal location</a>, <a href="https://publications.waset.org/abstracts/search?q=response%20time" title=" response time"> response time</a>, <a href="https://publications.waset.org/abstracts/search?q=S%2FR%20machine" title=" S/R machine"> S/R machine</a> </p> <a href="https://publications.waset.org/abstracts/73138/optimal-location-of-the-io-point-in-the-parking-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73138.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">409</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">3081</span> Optimal Driving Strategies for a Hybrid Street Type Motorcycle: Modelling and Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jhon%20Vargas">Jhon Vargas</a>, <a href="https://publications.waset.org/abstracts/search?q=Gilberto%20Osorio-Gomez"> Gilberto Osorio-Gomez</a>, <a href="https://publications.waset.org/abstracts/search?q=Tatiana%20Manrique"> Tatiana Manrique</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work presents an optimal driving strategy proposal for a 125 c.c. street-type hybrid electric motorcycle with a parallel configuration. The results presented in this article are complementary regarding the control proposal of a hybrid motorcycle. In order to carry out such developments, a representative dynamic model of the motorcycle is used, in which also are described different optimization functionalities for predetermined driving modes. The purpose is to implement an off-line optimal driving strategy which distributes energy to both engines by minimizing an objective torque requirement function. An optimal dynamic contribution is found from the optimization routine, and the optimal percentage contribution for vehicle cruise speed is implemented in the proposed online PID controller. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20model" title="dynamic model">dynamic model</a>, <a href="https://publications.waset.org/abstracts/search?q=driving%20strategies" title=" driving strategies"> driving strategies</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20hybrid%20motorcycle" title=" parallel hybrid motorcycle"> parallel hybrid motorcycle</a>, <a href="https://publications.waset.org/abstracts/search?q=PID%20controller" title=" PID controller"> PID controller</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/133692/optimal-driving-strategies-for-a-hybrid-street-type-motorcycle-modelling-and-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133692.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">188</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">3080</span> Optimal Implementation of Photovoltaic Water Pumping System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sarah%20Abdourraziq">Sarah Abdourraziq</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To improve the efficiency of photovoltaic pumping system, more attention has been paid to their setting up. This paper presents an optimal technique to establish an efficient system under different conditions of irradiance and temperature. The state of place should be carefully studied before stage of installation of the over system: local climate, boreholes, soil, crops and water resources. The studied system consists of a PV panel, a DC-DC boost converter, a DC motor-pump, and storage tank. The concepts shown in this paper presents a support for an optimal installation of each solar pump. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=photovoltaic%20pumping%20system" title="photovoltaic pumping system">photovoltaic pumping system</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20implementation" title=" optimal implementation"> optimal implementation</a>, <a href="https://publications.waset.org/abstracts/search?q=boost%20converter" title=" boost converter"> boost converter</a>, <a href="https://publications.waset.org/abstracts/search?q=motor-pump" title=" motor-pump"> motor-pump</a> </p> <a href="https://publications.waset.org/abstracts/59913/optimal-implementation-of-photovoltaic-water-pumping-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59913.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> <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=optimal%20distinctiveness&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distinctiveness&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distinctiveness&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distinctiveness&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distinctiveness&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distinctiveness&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distinctiveness&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distinctiveness&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distinctiveness&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=optimal%20distinctiveness&page=103">103</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distinctiveness&page=104">104</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distinctiveness&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>