Relevant bibliographies by topics / Proposed algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Proposed algorithm'

Author: Grafiati
Published: 4 June 2025
Last updated: 23 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Proposed algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Proposed algorithm"

1

Ali, Nawafil Abdulwahab, and Imad Al Shaikhli. "Proposed De-noising Algorithm." International Journal on Perceptive and Cognitive Computing 6, no. 2 (2020): 90–96. http://dx.doi.org/10.31436/ijpcc.v6i2.164.

Full text
Abstract:
minimizing noises from images to restore it and increase its quality is a crucial step. For this, an efficient algorithms were proposed to remove noises such as (salt pepper, Gaussian, and speckle) noises from grayscale images. The algorithm did that by selecting a window measuring 3x3 as the center of processing pixels, other algorithms did that by using median filter (MF), adopted median filter (AMF), adopted weighted filter (AWF), and the adopted weighted median filter (AWMF). The results showed that the proposed algorithm compares to previous algorithms by having a better signal-to-noise ratio (PSNR).
APA, Harvard, Vancouver, ISO, and other styles
2

Mohammed, Mohanad A., and Hala B. Abdul Wahab. "Proposed New Blockchain Consensus Algorithm." International Journal of Interactive Mobile Technologies (iJIM) 16, no. 20 (2022): 162–76. http://dx.doi.org/10.3991/ijim.v16i20.35549.

Full text
Abstract:
Blockchain technology considers the central technology that is used within many applications used frequently with human life. And the primary core of the blockchain is the consensus algorithm which may affect the security of the chain as well as the required resource consumption which affect mainly the blockchain performance directly. In recent years many consensus algorithms have been used and proposed such as proof of work (PoW) and proof of stake (PoS) and many others. However, these algorithms still need some improvement to the security and system resource consumption which will reduce the need for a huge amount of energy and save the environment as well as let the blockchain be useable within low computation ability devices such as the internet of things devices (IoT). This paper proposes a new consensus algorithm that ensures the integrity and authorization of nodes participating in the validation of the transaction and only a predefined number of nodes chosen randomly to participate in block addition which reduces the need for high computations power for mining and voting. The proposed algorithm needs lower time and computation costs comparable to the standard POW algorithm.
APA, Harvard, Vancouver, ISO, and other styles
3

Shalaby, Wafaa, Waleed Saad, Mona Shokair, and Moawad Dessouky. "Modified Recovery Algorithms Using proposed algorithm for Compressive Sampling." Menoufia Journal of Electronic Engineering Research 26, no. 1 (2017): 1–20. http://dx.doi.org/10.21608/mjeer.2017.63112.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yeo, Tiong-Cheng, Fang Qin Goh, Yao Neng Teo, and Ching-Hui Sia. "Approach to bradyarrhythmias: A proposed algorithm." Annals of the Academy of Medicine, Singapore 52, no. 2 (2023): 96–99. http://dx.doi.org/10.47102/annals-acadmedsg.2022411.

Full text
Abstract:
Bradyarrhythmias are commonly encountered in clinical practice. While there are several electrocardiographic criteria and algorithms for tachyarrhythmias, there is no algorithm for bradyarrhythmias to the best of our knowledge. In this article, we propose a diagnostic algorithm that uses simple concepts: (1) the presence or absence of P waves, (2) the relationship between the number of P waves and QRS complexes, and (3) the regularity of time intervals (PP, PR and RR intervals). We believe this straightforward, stepwise method provides a structured and thorough approach to the wide differential diagnosis of bradyarrhythmias, and in doing so, reduces misdiagnosis and mismanagement. Keywords: Arrhythmia, bradyarrhythmia, bradycardia, cardiology, electrocardiography
APA, Harvard, Vancouver, ISO, and other styles
5

Mohamed, Shereen Yousef, Mohamed Hamed N. Taha, Hesham N. Elmahdy, and Hany Harb. "A Proposed Load Balancing Algorithm Over Cloud Computing (Balanced Throttled)." International Journal of Recent Technology and Engineering (IJRTE) 10, no. 2 (2021): 28–33. http://dx.doi.org/10.35940/ijrte.b6101.0710221.

Full text
Abstract:
Cloud computing refers to the services and applications that are accessible throughout the world from data centers. All services and applications are available online. Virtual machine migration is an important part of virtualization which is considered as essential part in cloud computing environment. Virtual Machine Migration means transferring a running Virtual Machine with all its applications and the operating system state as it is to target destination machine where it continues to run as if nothing happened. It makes balancing between servers. This improves the performance by redistributing the workload among available servers. There are many algorithms of load balancing classified into two types: static load balancing algorithms and dynamic load balancing algorithms. This paper presents the algorithm (Balanced Throttled Load Balancing Algorithm- BTLB). It compares the results of the BTLB with round robin algorithm, AMLB algorithm and throttled load balancing algorithm. The results of these four algorithms would be presented in this paper. The proposed algorithm shows the improvement in response time (75 µs). Cloud analyst simulator is used to evaluate the results. BTLB was developed and tested using Java.
APA, Harvard, Vancouver, ISO, and other styles
6

Shereen, Yousef Mohamed, Hamed N. Taha Mohamed, N. Elmahdy Hesham, and Mohamed Mohieddin Harb Hany. "A Proposed Load Balancing Algorithm Over Cloud Computing (Balanced Throttled)." International Journal of Recent Technology and Engineering (IJRTE) 10, no. 2 (2021): 28–33. https://doi.org/10.35940/ijrte.B6101.0710221.

Full text
Abstract:
Cloud computing refers to the services and applications that are accessible throughout the world from data centers. All services and applications are available online. Virtual machine migration is an important part of virtualization which is considered as essential part in cloud computing environment. Virtual Machine Migration means transferring a running Virtual Machine with all its applications and the operating system state as it is to target destination machine where it continues to run as if nothing happened. It makes balancing between servers. This improves the performance by redistributing the workload among available servers. There are many algorithms of load balancing classified into two types: static load balancing algorithms and dynamic load balancing algorithms. This paper presents the algorithm (Balanced Throttled Load Balancing Algorithm- BTLB). It compares the results of the BTLB with round robin algorithm, AMLB algorithm and throttled load balancing algorithm. The results of these four algorithms would be presented in this paper. The proposed algorithm shows the improvement in response time (75 µs). Cloud analyst simulator is used to evaluate the results. BTLB was developed and tested using Java.
APA, Harvard, Vancouver, ISO, and other styles
7

El Hennawy, Hadia M. S., Alaa E. A. Omar, and Salah M. A. Kholaif. "LEA: Link Encryption Algorithm Proposed Stream Cipher Algorithm." Ain Shams Engineering Journal 6, no. 1 (2015): 57–65. http://dx.doi.org/10.1016/j.asej.2014.08.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Deghbouch, Hicham, and Fatima Debbat. "Hybrid Bees Algorithm with Grasshopper Optimization Algorithm for Optimal Deployment of Wireless Sensor Networks." Inteligencia Artificial 24, no. 67 (2021): 18–35. http://dx.doi.org/10.4114/intartif.vol24iss67pp18-35.

Full text
Abstract:
This work addresses the deployment problem in Wireless Sensor Networks (WSNs) by hybridizing two metaheuristics, namely the Bees Algorithm (BA) and the Grasshopper Optimization Algorithm (GOA). The BA is an optimization algorithm that demonstrated promising results in solving many engineering problems. However, the local search process of BA lacks efficient exploitation due to the random assignment of search agents inside the neighborhoods, which weakens the algorithm’s accuracy and results in slow convergence especially when solving higher dimension problems. To alleviate this shortcoming, this paper proposes a hybrid algorithm that utilizes the strength of the GOA to enhance the exploitation phase of the BA. To prove the effectiveness of the proposed algorithm, it is applied for WSNs deployment optimization with various deployment settings. Results demonstrate that the proposed hybrid algorithm can optimize the deployment of WSN and outperforms the state-of-the-art algorithms in terms of coverage, overlapping area, average moving distance, and energy consumption.
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Yi, and Kangshun Li. "A Lévy Flight-Inspired Random Walk Algorithm for Continuous Fitness Landscape Analysis." International Journal of Cognitive Informatics and Natural Intelligence 17, no. 1 (2023): 1–18. http://dx.doi.org/10.4018/ijcini.330535.

Full text
Abstract:
Heuristic algorithms are effective methods for solving complex optimization problems. The optimal algorithm selection for a specific optimization problem is a challenging task. Fitness landscape analysis (FLA) is used to understand the optimization problem's characteristics and help select the optimal algorithm. A random walk algorithm is an essential technique for FLA in continuous search space. However, most currently proposed random walk algorithms suffer from unbalanced sampling points. This article proposes a Lévy flight-based random walk (LRW) algorithm to address this problem. The Lévy flight is used to generate the proposed random walk algorithm's variable step size and direction. Some tests show that the proposed LRW algorithm performs better in the uniformity of sampling points. Besides, the authors analyze the fitness landscape of the CEC2017 benchmark functions using the proposed LRW algorithm. The experimental results indicate that the proposed LRW algorithm can better obtain the structural features of the landscape and has better stability than several other RW algorithms.
APA, Harvard, Vancouver, ISO, and other styles
10

kaushik, Yogita, Anup Bhola, and C. K. Jha. "Proposed SKYMAX Load balancing Algorithm." International Journal of Private Cloud Computing Environment and Management 2, no. 1 (2015): 9–16. http://dx.doi.org/10.21742/ijpccem.2015.2.1.02.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Proposed algorithm"

1

Kollberg, Simon. "Proposed scheduling algorithm for deployment of fail-safe cloud services." Thesis, Umeå universitet, Institutionen för datavetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-92838.

Full text
Abstract:
The cloud is a fairly new concept in computer science, altough almost everyone has been or is in contact with it on a regular basis. As more and more systems and applications are migrating from the desktop and into the cloud, keeping a high availability in cloud services is becoming increasingly important. Seeing that the cloud users are dependant on the cloud services being online and accessable via the Internet, creating fault tolerant cloud systems is key to keeping the cloud stable and trustworthy. This thesis researches different aspects of the cloud infrastructure such as virtualization which detaches the services from the physical hardware, scheduling algorithms that decides the mapping of virtual machines onto physical machines and fault tolerance in the context of availability in the cloud. It then proposes a new scheduling algorithm with the purpose of deploying virtual machines in a way that active-passive replication can be sustained.
APA, Harvard, Vancouver, ISO, and other styles
2

Spaizman, Daniel. "Grid-Scale Energy Storage: A Proposed Control Algorithm for Sodium Sulfur Batteries." DigitalCommons@CalPoly, 2014. https://digitalcommons.calpoly.edu/theses/1279.

Full text
Abstract:
With carbon dioxide levels in our atmosphere reaching record highs and 2020 quickly approaching, California is expected to pave the way for the United States in terms of replacing fossil fuel generation facilities with various renewable energy power plants. It is well documented that the inherent variability and limited duty cycle of renewables has hindered their growth. Energy storage technologies represent the bridge that can help us cross the divide from where we stand to where we must stand in the next 6 years. Utility companies value services such as peak shaving, voltage support, and frequency regulation, all of which energy storage technologies can provide. Commercial and residential clients’ of the utility will begin to install their own storage systems once properly incentivized. In this paper, a control algorithm for Sodium Sulfur batteries is proposed with hopes that the aforementioned services will be provided to the utilities while system owners realize profit.
APA, Harvard, Vancouver, ISO, and other styles
3

Montgomerie-Neilson, Gustav. "Selecting the Worst-Case Portfolio : A proposed pre-trade risk validation algorithm of SPAN." Thesis, KTH, Matematisk statistik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-102696.

Full text
Abstract:
Abstract This thesis outlines a possible pre-trade risk validation algorithm for portfolios of commodities futures and options. A method is proposed that, given an order book of unmatched orders, determines the particular order selection, or portfolio, with the maximum margin requirement, as calculated by the risk analysis methodology SPAN. The method consists of a selection algorithm, where all orders in the order book are either included or discarded according to a specified criterion. The selection criterion approach reduces the problem from exponential to linear time complexity, complying with pre-trade risk validation requirements. Further, three different selection criteria are proposed and evaluated by accuracy and time performance. Simulations indicate that one of the criteria has considerable accuracy in determining the worst-case portfolio in linear time, without relying on approximations of the orders it includes. This makes it a particularly suitable candidate for pre-trade risk validation.
APA, Harvard, Vancouver, ISO, and other styles
4

Tice, Peter. "Mineralogy of Eudialyte Group Minerals From the East Hill Suite Of the Mont Saint-Hilaire Alkaline Plutonic Complex, Including an Alternative Site-Assignment Algorithm & A Proposed Classification System." ScholarWorks@UNO, 2009. http://scholarworks.uno.edu/td/965.

Full text
Abstract:
The twenty approved members of the eudialyte group are complex zirconosilicates, primarily with general formula N15M(1)6M(2)3M(3)M(4)Z3[Si24O72]O4X2. An algorithm was created to address the inherent recalculation difficulties in the absence of single-crystal X-ray data and was an overall improvement over previous schemes. Eudialyte group minerals were analyzed from the East Hill Suite of the Mont Saint-Hilaire alkaline complex. Recalculations revealed previously undocumented eudialyte-group compositions and degrees of chemical zonation. These data suggest that late-stage melt heterogeneity in alkaline systems is far more pronounced than previously thought. All analyses exhibited a negative neodymium anomaly in chondrite-normalized data. This supports data from other investigators that point to a preintrusion fractionation event in the underlying mantle. Potassium content of the eudialyte group minerals from the East Hill Suite was restricted to a narrow range, as was that of analyses from numerous other localities, suggesting some internal control on potassium content in eudialyte group minerals.
APA, Harvard, Vancouver, ISO, and other styles
5

Rousset, Xavier. "La tarification dynamique, l'utile et le juste Seasonal factors and marketing mix: Literature survey and proposed guidelines An analytical framework for retailer price and advertising decisions for products with temperature-sensitive demand The impact of outdoor temperature on pricing and advertising policies for weather-sensitive products Tarification dynamique en ligne et éthicalité perçue par le consommateur : synthèse et voies de recherche Designing algorithmic dynamic pricing from an ethical perspective Are consumers vulnerable to algorithmic dynamic pricing? An empirical investigation." Thesis, Sorbonne Paris Cité, 2019. http://www.theses.fr/2019USPCB039.

Full text
Abstract:
Cette thèse regroupe différents travaux de recherche sur la tarification dynamique. L'objectif de la thèse, située à l'interface des sciences économiques, des sciences de gestion et des sciences politiques, est double : d'une part, étudier les déterminants et les conditions d'utilisation de la tarification dynamique au niveau de la firme dans une perspective de maximation de ses profits et, d'autre part, de montrer comment, à un niveau collectif, la prise en compte des questions éthiques dans l'étude de la tarification dynamique permet de mieux en comprendre la portée. Nos contributions, à la fois théoriques et empiriques, sont présentées en deux parties. La partie 1, axée sur l'efficacité économique (point de vue de l'utile), regroupe des questionnements sur les considérations de maximation du bénéfice liées à la tarification dynamique. A partir de l'étude de produits dits météo-sensibles dans les canaux de distribution physique, nous présentons une revue de littérature qui introduit l'adaptation dynamique du prix à des facteurs influençant la demande et nous proposons un modèle théorique d'adaptation dynamique du prix dans le temps suivant la température. Nous complétons cette approche théorique, par une étude empirique qui approfondit comment la tarification, exercée de manière dynamique du point de vue de la firme en réaction à des facteurs extérieurs, lui permet de maximiser ses intérêts. La partie 2 regroupe des travaux sur les considérations éthiques liées à la tarification dynamique (point de vue du juste). En se focalisant sur les canaux de distribution en ligne, nous discutons, sur un plan théorique, les incidences possibles de la tarification dynamique sur la perception éthique par le consommateur, en mettant en évidence les éventuels risques d'injustice ou de vulnérabilité que cette stratégie de fixation du prix soulève. D'un point de vue empirique, nous approfondissons l'analyse des déterminants de la perception éthique de la tarification dynamique en ligne par le consommateur, notamment en fonction des conditions de son paramétrage, ainsi que les dimensions de vulnérabilité qui préoccupent les consommateurs. La conclusion de la thèse regroupe des pistes de recherche futures portant sur l'approfondissement de la mesure de l'éthique perçue, sur les potentialités de l'hybridation de la science économique avec l'éthique sur un sujet comme celui de la tarification dynamique et sur les considérations que nous avons entrevues sur le lien entre la tarification dynamique et la révélation de la valeur d'échange (point de vue du vrai)<br>This PhD thesis brings together different research projects on dynamic pricing. The objective of the thesis, located at the interface of economics, management sciences and political sciences, is twofold: first, to study the determinants and conditions of use of dynamic pricing at the level of firm in a perspective of maximizing its profits and, on the other hand, to show how, at a collective level, the consideration of ethical issues in the study of dynamic pricing allows a better understanding of its scope. Our contributions, both theoretical and empirical, are presented in two parts. Part 1 focuses on economic efficiency (point of view of the useful), and asks questions about the maximization of profit considerations related to dynamic pricing. From the study of so-called weather-sensitive products in the physical distribution channels, we present a literature review that introduces the dynamic adaptation of the price to factors influencing the demand and we propose a theoretical model of dynamic adaptation of the price in time following the temperature. We complete this theoretical approach with an empirical study that examines how pricing, exercised dynamically from the firm's point of view in response to external factors, allows it to maximize its interests. Part 2 brings together work on ethical considerations related to dynamic pricing (the point of view of the right). Focusing on online distribution channels, we discuss, on a theoretical level, the potential impact of dynamic pricing on consumers' ethical perception, highlighting potential risks of unfairness or vulnerability that price fixing raises. From an empirical point of view, we thoroughly analyse the determinants of the ethical perception of online dynamic pricing by the consumer, in particular according to the conditions of its setting, as well as the dimensions of vulnerability that concern consumers.The conclusion of the thesis brings together future lines of research on the deepening of the measurement of perceived ethics, on the potentialities of the hybridization of economic science with ethics on a subject such as dynamic pricing and on the considerations we have seen on the link between dynamic pricing and the revelation of exchange value (point of view of the true)
APA, Harvard, Vancouver, ISO, and other styles
6

Correa, Leonardo de Lima. "Uma proposta de algoritmo memético baseado em conhecimento para o problema de predição de estruturas 3-D de proteínas." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/156640.

Full text
Abstract:
Algoritmos meméticos são meta-heurísticas evolutivas voltadas intrinsecamente à exploração e incorporação de conhecimentos relacionados ao problema em estudo. Nesta dissertação, foi proposto um algoritmo memético multi populacional baseado em conhecimento para lidar com o problema de predição de estruturas tridimensionais de proteínas voltado à modelagem de estruturas livres de similaridades conformacionais com estruturas de proteínas determinadas experimentalmente. O algoritmo em questão, foi estruturado em duas etapas principais de processamento: (i) amostragem e inicialização de soluções; e (ii) otimização dos modelos estruturais provenientes da etapa anterior. A etapa I objetiva a geração e classificação de diversas soluções, a partir da estratégia Lista de Probabilidades Angulares, buscando a definição de diferentes grupos estruturais e a criação de melhores estruturas a serem incorporadas à meta-heurística como soluções iniciais das multi populações. A segunda etapa consiste no processo de otimização das estruturas oriundas da etapa I, realizado por meio da aplicação do algoritmo memético de otimização, o qual é fundamentado na organização da população de indivíduos em uma estrutura em árvore, onde cada nodo pode ser interpretado como uma subpopulação independente, que ao longo do processo interage com outros nodos por meio de operações de busca global voltadas a características do problema, visando o compartilhamento de informações, a diversificação da população de indivíduos, e a exploração mais eficaz do espaço de busca multimodal do problema O algoritmo engloba ainda uma implementação do algoritmo colônia artificial de abelhas, com o propósito de ser utilizado como uma técnica de busca local a ser aplicada em cada nodo da árvore. O algoritmo proposto foi testado em um conjunto de 24 sequências de aminoácidos, assim como comparado a dois métodos de referência na área de predição de estruturas tridimensionais de proteínas, Rosetta e QUARK. Os resultados obtidos mostraram a capacidade do método em predizer estruturas tridimensionais de proteínas com conformações similares a estruturas determinadas experimentalmente, em termos das métricas de avaliação estrutural Root-Mean-Square Deviation e Global Distance Total Score Test. Verificou-se que o algoritmo desenvolvido também foi capaz de atingir resultados comparáveis ao Rosetta e ao QUARK, sendo que em alguns casos, os superou. Corroborando assim, a eficácia do método.<br>Memetic algorithms are evolutionary metaheuristics intrinsically concerned with the exploiting and incorporation of all available knowledge about the problem under study. In this dissertation, we present a knowledge-based memetic algorithm to tackle the threedimensional protein structure prediction problem without the explicit use of template experimentally determined structures. The algorithm was divided into two main steps of processing: (i) sampling and initialization of the algorithm solutions; and (ii) optimization of the structural models from the previous stage. The first step aims to generate and classify several structural models for a determined target protein, by the use of the strategy Angle Probability List, aiming the definition of different structural groups and the creation of better structures to initialize the initial individuals of the memetic algorithm. The Angle Probability List takes advantage of structural knowledge stored in the Protein Data Bank in order to reduce the complexity of the conformational search space. The second step of the method consists in the optimization process of the structures generated in the first stage, through the applying of the proposed memetic algorithm, which uses a tree-structured population, where each node can be seen as an independent subpopulation that interacts with others, over global search operations, aiming at information sharing, population diversity, and better exploration of the multimodal search space of the problem The method also encompasses ad-hoc global search operators, whose objective is to increase the exploration capacity of the method turning to the characteristics of the protein structure prediction problem, combined with the Artificial Bee Colony algorithm to be used as a local search technique applied to each node of the tree. The proposed algorithm was tested on a set of 24 amino acid sequences, as well as compared with two reference methods in the protein structure prediction area, Rosetta and QUARK. The results show the ability of the method to predict three-dimensional protein structures with similar foldings to the experimentally determined protein structures, regarding the structural metrics Root-Mean-Square Deviation and Global Distance Total Score Test. We also show that our method was able to reach comparable results to Rosetta and QUARK, and in some cases, it outperformed them, corroborating the effectiveness of our proposal.
APA, Harvard, Vancouver, ISO, and other styles
7

Austad, Haakon Michael. "Parallel Multiple Proposal MCMC Algorithms." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for matematiske fag, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-12857.

Full text
Abstract:
We explore the variance reduction achievable through parallel implementation of multi-proposal MCMC algorithms and use of control variates. Implemented sequentially multi-proposal MCMC algorithms are of limited value, but they are very well suited for parallelization. Further, discarding the rejected states in an MCMC sampler can intuitively be interpreted as a waste of information. This becomes even more true for a multi-proposal algorithm where we discard several states in each iteration. By creating an alternative estimator consisting of a linear combination of the traditional sample mean and zero mean random variables called control variates we can improve on the traditional estimator. We present a setting for the multi-proposal MCMC algorithm and study it in two examples. The first example considers sampling from a simple Gaussian distribution, while for the second we design the framework for a multi-proposal mode jumping algorithm for sampling from a distribution with several separated modes. We find that the variance reduction achieved from our control variate estimator in general increases as the number of proposals in our sampler increase. For our Gaussian example we find that the benefit from parallelization is small, and that little is gained from increasing the number of proposals. The mode jumping example however is very well suited for parallelization and we get a relative variance reduction pr time of roughly 80% with 16 proposals in each iteration.
APA, Harvard, Vancouver, ISO, and other styles
8

Yeh, Chih Lung. "A framework proposal for algorithm animation systems." Thesis, Nelson Mandela Metropolitan University, 2006. http://hdl.handle.net/10948/d1019680.

Full text
Abstract:
The learning and analysis of algorithms and algorithm concepts are challenging to students due to the abstract and conceptual nature of algorithms. Algorithm animation is a form of technological support tool which encourages algorithm comprehension by visualising algorithms in execution. Algorithm animation can potentially be utilised to support students while learning algorithms. Despite widespread acknowledgement for the usefulness of algorithm animation in algorithm courses at tertiary institutions, no recognised framework exists upon which algorithm animation systems can be effectively modelled. This dissertation consequently focuses on the design of an extensible algorithm animation framework to support the generation of interactive algorithm animations. A literature and extant system review forms the basis for the framework design process. The result of the review is a list of requirements for a pedagogically effective algorithm animation system. The proposed framework supports the pedagogic requirements by utilising an independent layer structure to support the generation and display of algorithm animations. The effectiveness of the framework is evaluated through the implementation of a prototype algorithm animation system using sorting algorithms as a case study. This dissertation is successful in proposing a framework to support the development of algorithm animations. The prototype developed will enable the integration of algorithm animations into the Nelson Mandela Metropolitan University’s teaching model, thereby permitting the university to conduct future research relating to the usefulness of algorithm animation in algorithm courses.
APA, Harvard, Vancouver, ISO, and other styles
9

Reiff, Thamara Brassolins. "Programação de computadores: uma proposta para o 9º ano do ensino fundamental." Universidade Federal de Juiz de Fora (UFJF), 2017. https://repositorio.ufjf.br/jspui/handle/ufjf/5845.

Full text
Abstract:
Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-09-29T11:58:27Z No. of bitstreams: 1 thamarabrassolinsreiff.pdf: 1054175 bytes, checksum: 3b7ac80eb048ad4107ca02e8f424a527 (MD5)<br>Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-10-09T19:36:16Z (GMT) No. of bitstreams: 1 thamarabrassolinsreiff.pdf: 1054175 bytes, checksum: 3b7ac80eb048ad4107ca02e8f424a527 (MD5)<br>Made available in DSpace on 2017-10-09T19:36:16Z (GMT). No. of bitstreams: 1 thamarabrassolinsreiff.pdf: 1054175 bytes, checksum: 3b7ac80eb048ad4107ca02e8f424a527 (MD5) Previous issue date: 2017-08-02<br>CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>Este trabalho é uma proposta para o ensino de algoritmos de programação para alunos do 9o ano do Ensino Fundamental. Ele apresenta uma breve história da disseminação do ensino de algoritmos, especialmente no Brasil, bem como sua definição e principais formas de representação. Além disso, pensado como um projeto a ser desenvolvido no contraturno e na modalidade extraclasse, este trabalho apresenta um estudo teórico sobre VisuAlg e seus principais comandos e sugere 18 atividades que introduzem gradualmente conceitos básicos para a construção de algoritmos. Cada atividade apresenta um problema matemático que deve ser pensado e estruturado sob a forma de pseudocódigo e escrito diretamente em VisuAlg.<br>This work is a proposal for the teaching of a programming algorithm for 9th grade students. It presents a brief history of the dissemination of algorithm teaching, especially in Brazil, as well as its definition and main forms of representation. In addition, thought as a project to be developed in a after/before school program and in a extra shift modality, this work presents a theoretical study on VisuAlg and its main commands and suggests 18 activities that gradually introduce basic concepts for the construction of algorithms. Each activity presents a mathematical problem that must be thought and structured in the form of pseudocode and written directly in VisuAlg.
APA, Harvard, Vancouver, ISO, and other styles
10

Tricot, Michel. "A propos de quelques applications de la classification automatique." Université Joseph Fourier (Grenoble ; 1971-2015), 1986. http://www.theses.fr/1986GRE10077.

Full text
Abstract:
Ce travail montre trois exemples d'applications originales de la Classification automatique. Un, concerne la gestion de systèmes informatiques, un autre, les micro-circuits, le dernier, les essais thérapeutiques. Une description complète est donnée des algorithmes «pseudo-hiérarchique» utilisée, que nous avons appelés «Algorithmes de percolation généralisés». Finalement, une étude critique de la validité des résultats est proposée
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Proposed algorithm"

1

United States. Dept. of Energy. and Geological Survey (U.S.), eds. Proposed algorithm for determining the delta intercept of a thermocouple psychrometer curve. U.S. Dept. of the Interior, U.S. Geological Survey, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

United States. Dept. of Energy and Geological Survey (U.S.), eds. Proposed algorithm for determining the delta intercept of a thermocouple psychrometer curve. U.S. Dept. of the Interior, U.S. Geological Survey, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

B, Gilyard Glenn, United States. National Aeronautics and Space Administration. Scientific and Technical Information Division., and Dryden Flight Research Facility, eds. A proposed Kalman filter algorithm for estimation of unmeasured output variables for an F100 turbofan engine. National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Division, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Munerman, Viktor, Vadim Borisov, and Aleksandra Kononova. Mass data processing. Algebraic models and methods. INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/1906037.

Full text
Abstract:
The monograph is devoted to mathematical and algorithmic support of mass data processing based on algebraic models. One of the most common classes of mass processing is considered - processing of highly active structured data. The construction of algebraic models of data and calculations and methods of proving their correspondence are analyzed. Three algebraic systems are studied, which can be used both as data models and as models of calculations. The algebraic and axiomatic methods of proving the correspondence of these models are investigated. A proof of their correspondence is given: homomorphism and isomorphism. The problem of optimizing the processes of mass processing of data presented in the form of algebraic expressions in the proposed algebra models is raised. The algorithms of synthesis and optimization of calculation of these expressions, the method of symmetric horizontal data distribution providing parallel implementation of calculation of algebraic expressions and generalization of the block algorithm of parallel matrix multiplication for the case of multiplication of multidimensional matrices are described in detail. Architectures of software and hardware complexes for effective parallel implementation of operations in the considered algebra models are proposed. A number of real-world examples illustrating the application of the proposed methods are given.&#x0D; For students, postgraduates and teachers of technical and physical-mathematical universities and faculties.
APA, Harvard, Vancouver, ISO, and other styles
5

Dubanov, Aleksandr. Geometric modeling of pursuit problems in Mathcad. Publishing Center RIOR, 2020. http://dx.doi.org/10.29039/02031-9.

Full text
Abstract:
This monograph publishes a description of the methods and algorithms of pursuit problems on surfaces, and also the simulation of tasks in the programming environment Mathcad. As a result of computer modeling, many animated videos were obtained that allow you to see the algorithmic solutions proposed by the author in the pursuit problems. The monograph may be useful to students of technical universities, graduate students and developers of robotic systems with elements of artificial intelligence.
APA, Harvard, Vancouver, ISO, and other styles
6

Kazakova, Nataliya, and Lyudmila Permitina. ESG-the concept of production accounting and sustainability management of an industrial organization. INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/2049716.

Full text
Abstract:
The monograph is devoted to the formation of the concept of production accounting based on the principles of sustainable development. The stages of formation and transformation of accounting practices of industrial organizations are considered. The ESG model of production accounting and control is described. An algorithm for assessing the sustainability of the development of an industrial organization is proposed.&#x0D; For researchers, researchers, teachers, and degree seekers. It can be used in the system of additional professional education, advanced training, for self-development of managerial personnel of financial and economic services in business and government structures.
APA, Harvard, Vancouver, ISO, and other styles
7

Vasil'ev, Oleg, Evgeniy Achkasov, and Sergey Levushkin. Damage to the musculoskeletal system from overload in ballet and sports medicine. INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/1938064.

Full text
Abstract:
The monograph, based on a long-term interdisciplinary study, outlines the features of the diagnosis and rehabilitation of injuries from overload of the lower limb on movement patterns unnatural for normal life, but typical for types of motor activity associated with the art of movement (choreography, classical dance, rhythmic gymnastics, etc.). It is shown that not so much professional requirements, as a lack of constitutional conditioned abilities are the cause of overload damage, the main predictor of which is muscle hypertonicity.&#x0D; The main X-ray morphological types of the structure of hip joints in this contingent of persons are given. The clinical significance of evaluating the performance of basic choreographic elements and the availability of professional abilities for diagnostic purposes is shown. A professionally oriented algorithm for diagnosing overload damage has been proposed, unique clinical-functional and clinical-biomechanical diagnostic methods have been developed. Reference indicators of dosing and assessment of the adequacy of local physical activity on the restored link of the musculoskeletal system are proposed, a mathematical model of their application is developed.&#x0D; Professionally oriented methods and features of using physical activity with a training effect for rehabilitation purposes using sports training tools and natural and geographical factors, as well as features of the use of Chinese Taijiquan gymnastics are described. The algorithm of multilevel rehabilitation based on N.A. Bernstein's theory of motion construction is described.&#x0D; For students, postgraduates and teachers of medical universities. It will be of interest to sports medicine doctors, orthopedic traumatologists, rehabilitologists and other specialists in the field of medical and biological support of choreography and sports.
APA, Harvard, Vancouver, ISO, and other styles
8

Dubanov, Aleksandr. Simulation of pursuit and parallel approach methods in pursuit problems. Publishing Center RIOR, 2021. http://dx.doi.org/10.29039/02071-5.

Full text
Abstract:
This monograph publishes a description of methods and algorithms for pursuit problems on surfaces. Simulation of tasks in the Mathcad programming environment was made. The development of digital technologies makes it possible to simulate a variety of problems from the theory of differential games. As a result of computer modeling, a lot of animation videos were obtained, which allow you to see the algorithmic solutions proposed by the author in pursuit problems.&#x0D; The monograph can be useful for students of technical universities, graduate students and developers of robotic systems with elements of artificial intelligence.
APA, Harvard, Vancouver, ISO, and other styles
9

Titova, Elena. How to write an essay on social studies at the Olympiad: preparing for the Unified State Exam. INFRA-M Academic Publishing LLC., 2024. http://dx.doi.org/10.12737/1214778.

Full text
Abstract:
The textbook is intended for preparation for tasks of the Olympiad level — writing an essay on one of the sections of social studies: "Man and Society" (philosophy), "Economic life", "Social sphere", "Political sphere", "Legal regulation of public relations". An algorithm for preparing an essay is proposed step by step. The proposed principles of working with the essay will also help to complete task 25 in the control and measuring materials (CMM) of the Unified State Exam in social studies. The author's own long-term experience of working with schoolchildren in advising on preparing for the Unified State Exam in social studies is presented, practical recommendations for writing essays are given, quotations and examples of essays by graduates of previous years are analyzed. The material will help you prepare yourself for tasks of a higher level of complexity, successfully cope with writing an essay to get a high score at the All-Russian Olympiads. For students preparing for the Unified State Exam in social studies, teachers of social studies and history, methodologists, tutors and social studies consultants.
APA, Harvard, Vancouver, ISO, and other styles
10

Kravchenko, Igor', Maksim Glinskiy, Sergey Karcev, Viktor Korneev, and Diana Abdumuminova. Resource-saving plasma technology in the repair of processing equipment. INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1083289.

Full text
Abstract:
In the monograph methodological bases of selection of method of coating, design of technological processes of hardening and recovery of the wearing surfaces of parts using a systems engineering analysis and information support technologist. The mathematical model of plasma spraying of materials with different thermal conductivity and methods criteria for evaluation of technical and technological opportunities of a plasma coating method. Describes the methods and results of experimental studies, the analysis of the conditions and causes of loss of efficiency of processing equipment APK. The proposed scientific and methodical approach to the justification of expediency of the recovery and strengthening of the working bodies and parts expensive imported technological equipment. The proposed mathematical model describing the physical processes in plasma coating for various applications. The structure of the algorithm for solving the task of hardening and recovery of worn parts plasma methods on the basis of the integrated CAE system.&#x0D; This monograph is intended for employees of scientific research institutions, specialists of machine-building production and enterprises of technical service, as well as teachers, postgraduates and students of agricultural engineering areas of training.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Proposed algorithm"

1

Astudillo, Leslie, Patricia Melin, and Oscar Castillo. "The Proposed Chemical Reaction Algorithm." In Chemical Optimization Algorithm for Fuzzy Controller Design. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-05245-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Abdelgawad, Ahmed, and Magdy Bayoumi. "Proposed Multiplication Algorithm for DKF." In Resource-Aware Data Fusion Algorithms for Wireless Sensor Networks. Springer US, 2012. http://dx.doi.org/10.1007/978-1-4614-1350-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Abualigah, Laith Mohammad Qasim. "Proposed Methodology." In Feature Selection and Enhanced Krill Herd Algorithm for Text Document Clustering. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-10674-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jin, Xi, Changqing Xia, Chi Xu, and Dong Li. "Mixed-Criticality Scheduling for TDMA Networks." In Mixed-Criticality Industrial Wireless Networks. Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-8922-3_4.

Full text
Abstract:
AbstractTo improve the schedulability of mixed-criticality industrial wireless networks, targeted algorithms should be developed. Therefore, in this chapter, we propose a mixed-criticality scheduling algorithm. The algorithm supports centralized optimization and adaptive adjustment. It can improve both the schedulability and flexibility. We conduct extensive simulations, and the results demonstrate that the proposed scheduling algorithm significantly outperforms existing ones.
APA, Harvard, Vancouver, ISO, and other styles
5

Caraveo, Camilo, Fevrier Valdez, and Oscar Castillo. "Proposed Method." In A New Bio-inspired Optimization Algorithm Based on the Self-defense Mechanism of Plants in Nature. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-05551-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Castillo, Oscar, Patricia Ochoa, and Jose Soria. "Proposed Method." In Differential Evolution Algorithm with Type-2 Fuzzy Logic for Dynamic Parameter Adaptation with Application to Intelligent Control. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-62133-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zayoud, Maha. "The Proposed β Algorithm for Healthcare System." In Process Mining Techniques for Managing and Improving Healthcare Systems. CRC Press, 2023. http://dx.doi.org/10.1201/9781003366577-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kalita, Nitashi, Chitra, Radhika Sharma, and Samarjeet Borah. "eKMP: A Proposed Enhancement of KMP Algorithm." In Computational Intelligence in Data Mining - Volume 3. Springer India, 2014. http://dx.doi.org/10.1007/978-81-322-2202-6_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Amezcua, Jonathan, Patricia Melin, and Oscar Castillo. "Proposed Classification Method." In New Classification Method Based on Modular Neural Networks with the LVQ Algorithm and Type-2 Fuzzy Logic. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-73773-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mitchell, Ian, and Kamil Maka. "A Proposed Permissioned Blockchain Consensus Algorithm: Consensus Algorithm Genetically Enhanced (CAGE)." In Cybersecurity Challenges in the Age of AI, Space Communications and Cyborgs. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-47594-8_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Proposed algorithm"

1

K, Justin Jayaraj, Padmacharan V, Balasubramaniam Vadivel, Gokulraj G, Ramachandramoorthy K B, and Kirthika K. "Person Detection using Proposed YOLOv8 algorithm." In 2025 IEEE 14th International Conference on Communication Systems and Network Technologies (CSNT). IEEE, 2025. https://doi.org/10.1109/csnt64827.2025.10967648.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ni, Lim Chia, Samura Ali, Amy Nurul Asyran Abdull Aziz, and Rozeha A. Rashid. "Implementation of Proposed Cryptography Algorithm on ESP32-Based IoT System." In 2024 IEEE International Conference on Advanced Telecommunication and Networking Technologies (ATNT). IEEE, 2024. http://dx.doi.org/10.1109/atnt61688.2024.10719299.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kannojiya, Ravindra, Mohnish Dulwani, and Kartikey Sharma. "Proposed Algorithm (P.E.A) for Optimization." In 2018 8th International Conference on Cloud Computing, Data Science & Engineering (Confluence). IEEE, 2018. http://dx.doi.org/10.1109/confluence.2018.8442966.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pimpale, Radha, P. K. Butey, and R. L. Sonlikar. "A novel proposed deer algorithm." In 2017 International Conference on Information, Communication, Instrumentation and Control (ICICIC). IEEE, 2017. http://dx.doi.org/10.1109/icomicon.2017.8279049.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

kaushik, Yogita, Anup Bhola, and C. K. Jha. "Proposed SKYMAX Load balancing Algorithm." In the International Conference. ACM Press, 2016. http://dx.doi.org/10.1145/2979779.2979850.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Huang, Mingjuan, Laibo Zheng, Xinfeng Zhao, and Jintang Wang. "A novel fast algorithm proposed based on Leke’s algorithm." In Fifth International Conference on Machine Vision (ICMV 12), edited by Yulin Wang, Liansheng Tan, and Jianhong Zhou. SPIE, 2013. http://dx.doi.org/10.1117/12.2013670.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sawant, Vinaya, and Ketan Shah. "Evaluating the Performance of Proposed IODAM Algorithm." In 2019 International Conference on Nascent Technologies in Engineering (ICNTE). IEEE, 2019. http://dx.doi.org/10.1109/icnte44896.2019.8945921.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ahmed Mohammed, Ahssan, and Abdulkareem O. Ibadi. "A Proposed Non Feistel Block Cipher Algorithm." In 1st International Conference on Information Technology. Lebanese French University - LFU, 2017. http://dx.doi.org/10.25212/icoit17.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rohini and Tejinder Sharma. "Proposed hybrid RSA algorithm for cloud computing." In 2018 2nd International Conference on Inventive Systems and Control (ICISC). IEEE, 2018. http://dx.doi.org/10.1109/icisc.2018.8398902.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yu, Chunsheng, Jinzhou Zhao, Lianwu Li, and Na Su. "A Proposed Algorithm of Stochastic Network Generation." In 2011 International Conference on Computational and Information Sciences (ICCIS). IEEE, 2011. http://dx.doi.org/10.1109/iccis.2011.52.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Proposed algorithm"

1

Kurzmack, M. A. Proposed algorithm for determining the delta intercept of a thermocouple psychrometer curve. Office of Scientific and Technical Information (OSTI), 1993. http://dx.doi.org/10.2172/138658.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Qi, Fei, Zhaohui Xia, Gaoyang Tang, et al. A Graph-based Evolutionary Algorithm for Automated Machine Learning. Web of Open Science, 2020. http://dx.doi.org/10.37686/ser.v1i2.77.

Full text
Abstract:
As an emerging field, Automated Machine Learning (AutoML) aims to reduce or eliminate manual operations that require expertise in machine learning. In this paper, a graph-based architecture is employed to represent flexible combinations of ML models, which provides a large searching space compared to tree-based and stacking-based architectures. Based on this, an evolutionary algorithm is proposed to search for the best architecture, where the mutation and heredity operators are the key for architecture evolution. With Bayesian hyper-parameter optimization, the proposed approach can automate the workflow of machine learning. On the PMLB dataset, the proposed approach shows the state-of-the-art performance compared with TPOT, Autostacker, and auto-sklearn. Some of the optimized models are with complex structures which are difficult to obtain in manual design.
APA, Harvard, Vancouver, ISO, and other styles
3

Fadieieva, Liliia O., and Pavlo V. Merzlykin. The avalanche criterion satisfaction research of the turmite-based cryptographic algorithm. [б. в.], 2018. http://dx.doi.org/10.31812/123456789/2887.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cao, Zhengjun, Lihua Liu, and Andreas Christoforides. A Note on One Realization of a Scalable Shor Algorithm. Web of Open Science, 2020. http://dx.doi.org/10.37686/qrl.v1i2.81.

Full text
Abstract:
Very recently, Monz, et al. have reported the demonstration of factoring 15 using a scalable Shor algorithm with an ion-trap quantum computer. In this note, we remark that the report is somewhat misleading because there are three flaws in the proposed circuit diagram of Shor algorithm. We also remark that the principles behind the demonstration have not been explained properly, including its correctness and complexity.
APA, Harvard, Vancouver, ISO, and other styles
5

Bodson, D. Simulation and Evaluation of the AT&T Proposed Pattern Recognition Algorithm for Group 4 Facsimile. Defense Technical Information Center, 1985. http://dx.doi.org/10.21236/ada160864.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tayeb, Shahab. Intelligent Blind Crossings for Suburban and Rural Intersections. Mineta Transportation Institute, 2025. https://doi.org/10.31979/mti.2024.2351.

Full text
Abstract:
Blind intersections in suburban and rural areas pose significant safety challenges due to limited visibility and inadequate infrastructure. This project proposes an innovative solution leveraging the Internet of Vehicles (IoV) paradigm, utilizing connected and autonomous vehicles (CAVs) for seamless communication to enhance safety at these intersections. The research focuses on developing a specialized Road-Side Unit (RSU) system equipped with a Virtual Traffic Light Algorithm implemented on a Field-Programmable Gate Array (FPGA). Key stakeholders, including transportation authorities, vehicle manufacturers, and local communities, stand to benefit from this initiative. The RSU system acts as a critical infrastructure component, facilitating efficient intersection management and mitigating visibility challenges. Methodologies involve adapting the Virtual Traffic Light Algorithm, integrating it into the FPGA-based RSU system, and demonstrating RSU communication operability through software-defined radios. Additionally, a novel solar-powered system is designed for lightweight RSUs to enhance sustainability and energy efficiency. The project's findings indicate the feasibility and practicality of the proposed RSU solution in enhancing safety at blind intersections. Successful implementation of the Virtual Traffic Light Algorithm on the FPGA demonstrates its potential for real-world deployment. The operability demonstration of RSU communication validates the effectiveness of the proposed communication system. Overall, this research contributes to advancing safety measures in transportation infrastructure, with potential implications for future urban planning and policy development.
APA, Harvard, Vancouver, ISO, and other styles
7

Baader, Franz, Stefan Borgwardt, and Barbara Morawska. A Goal-Oriented Algorithm for Unification in ELHR+ w.r.t. Cycle-Restricted Ontologies. Technische Universität Dresden, 2012. http://dx.doi.org/10.25368/2022.189.

Full text
Abstract:
Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. For the DL EL, which is used to define several large biomedical ontologies, unification is NP-complete. A goal-oriented NP unification algorithm for EL that uses nondeterministic rules to transform a given unification problem into solved form has recently been presented. In this report, we extend this goal-oriented algorithm in two directions: on the one hand, we add general concept inclusion axioms (GCIs), and on the other hand, we add role hierarchies (H) and transitive roles (R+). For the algorithm to be complete, however, the ontology consisting of the GCIs and role axioms needs to satisfy a certain cycle restriction.
APA, Harvard, Vancouver, ISO, and other styles
8

Warwick, W. M. Energy savings from energy-efficient showerheads: REMP case study results, proposed evaluation algorithm, and program design implications. Office of Scientific and Technical Information (OSTI), 1993. http://dx.doi.org/10.2172/10185385.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Baader, Franz, Stefan Borgwardt, and Barbara Morawska. Unification in the Description Logic EL w.r.t. Cycle-Restricted TBoxes. Technische Universität Dresden, 2011. http://dx.doi.org/10.25368/2022.183.

Full text
Abstract:
Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. The inexpressive Description Logic EL is of particular interest in this context since, on the one hand, several large biomedical ontologies are defined using EL. On the other hand, unification in EL has recently been shown to be NP-complete, and thus of significantly lower complexity than unification in other DLs of similarly restricted expressive power. However, the unification algorithms for EL developed so far cannot deal with general concept inclusion axioms (GCIs). This paper makes a considerable step towards addressing this problem, but the GCIs our new unification algorithm can deal with still need to satisfy a certain cycle restriction.
APA, Harvard, Vancouver, ISO, and other styles
10

Baader, Franz, Oliver Fernández Gil, and Barbara Morawska. Hybrid Unification in the Description Logic EL. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.197.

Full text
Abstract:
Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. For the DL EL, which is used to define several large biomedical ontologies, unification is NP-complete. However, the unification algorithms for EL developed until recently could not deal with ontologies containing general concept inclusions (GCIs). In a series of recent papers we have made some progress towards addressing this problem, but the ontologies the developed unification algorithms can deal with need to satisfy a certain cycle restriction. In the present paper, we follow a different approach. Instead of restricting the input ontologies, we generalize the notion of unifiers to so-called hybrid unifiers. Whereas classical unifiers can be viewed as acyclic TBoxes, hybrid unifiers are cyclic TBoxes, which are interpreted together with the ontology of the input using a hybrid semantics that combines fixpoint and descriptive semantics. We show that hybrid unification in EL is NP-complete and introduce a goal-oriented algorithm for computing hybrid unifiers.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Proposed algorithm' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography