Bibliographies thématiques / Algorithms and implementation / Articles de revues
Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Algorithms and implementation.

Articles de revues sur le sujet « Algorithms and implementation »

Auteur : Grafiati
Publié le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Algorithms and implementation ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

Tsaramirsis, Kostandinos, Georgios Tsaramirsis, Fazal Qudus Khan, Awais Ahmad, Alaa Omar Khadidos et Adil Khadidos. « More Agility to Semantic Similarities Algorithm Implementations ». International Journal of Environmental Research and Public Health 17, no 1 (30 décembre 2019) : 267. http://dx.doi.org/10.3390/ijerph17010267.

Texte intégral
Résumé :
Algorithms for measuring semantic similarity between Gene Ontology (GO) terms has become a popular area of research in bioinformatics as it can help to detect functional associations between genes and potential impact to the health and well-being of humans, animals, and plants. While the focus of the research is on the design and improvement of GO semantic similarity algorithms, there is still a need for implementation of such algorithms before they can be used to solve actual biological problems. This can be challenging given that the potential users usually come from a biology background and they are not programmers. A number of implementations exist for some well-established algorithms but these implementations are not generic enough to support any algorithm other than the ones they are designed for. The aim of this paper is to shift the focus away from implementation, allowing researchers to focus on algorithm’s design and execution rather than implementation. This is achieved by an implementation approach capable of understanding and executing user defined GO semantic similarity algorithms. Questions and answers were used for the definition of the user defined algorithm. Additionally, this approach understands any direct acyclic digraph in an Open Biomedical Ontologies (OBO)-like format and its annotations. On the other hand, software developers of similar applications can also benefit by using this as a template for their applications.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Verma, Rohit, et Jyoti Dhiman. « Implementation of Improved Cryptography Algorithm ». International Journal of Information Technology and Computer Science 14, no 2 (8 avril 2022) : 45–53. http://dx.doi.org/10.5815/ijitcs.2022.02.04.

Texte intégral
Résumé :
A network is an interconnected group of independent computing devices which uses a different set of protocols to communicate with each other independently and meaningfully. This communication should be carried out securely. Due to different attacks, this security sometimes gets compromised. So, to communicate securely different cryptography algorithms are used i.e., symmetric and asymmetric algorithms. Cryptography helps to achieve authentication, confidentiality, integrity, non-repudiation, and availability of data. Nowadays many algorithms provide security to data but these algorithms have various security flaws. To improve the strength of these algorithms, a new security protocol is designed using features of symmetric key and asymmetric key algorithms. The security principles can be achieved by AES and RSA algorithms. The main purpose of designing this algorithm is to provide better security to data in transit against passive as well as from active attacks. The new proposed hybrid algorithm is implemented in MATLAB R2019a. This algorithm will be analysed and compared on three parameters like avalanche effect, performance, and security against attacks. The proposed model will contribute towards improving the excellence of educators and academics, as well as increase competitiveness of educational programmes on cybersecurity among similar institutions in the EU countries.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Bassil, Youssef. « Implementation of Combinatorial Algorithms using Optimization Techniques ». International Journal of Trend in Scientific Research and Development Volume-3, Issue-3 (30 avril 2019) : 660–66. http://dx.doi.org/10.31142/ijtsrd22925.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Bassil, Youssef. « Implementation of Computational Algorithms using Parallel Programming ». International Journal of Trend in Scientific Research and Development Volume-3, Issue-3 (30 avril 2019) : 704–10. http://dx.doi.org/10.31142/ijtsrd22947.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Mehlhorn, Kurt, et Michael Seel. « Infimaximal Frames : A Technique for Making Lines Look Like Segments ». International Journal of Computational Geometry & ; Applications 13, no 03 (juin 2003) : 241–55. http://dx.doi.org/10.1142/s0218195903001141.

Texte intégral
Résumé :
Many geometric algorithms that are usually formulated for points and segments generalize easily to inputs also containing rays and lines. The sweep algorithm for segment intersection is a prototypical example. Implementations of such algorithms do, in general, not extend easily. For example, segment endpoints cause events in sweep line algorithms, but lines have no endpoints. We describe a general technique, which we call infimaximal frames, for extending implementations to inputs also containing rays and lines. The technique can also be used to extend implementations of planar subdivisions to subdivisions with many unbounded faces. We have used the technique successfully in generalizing a sweep algorithm designed for segments to rays and lines and also in an implementation of planar Nef polyhedra.14,1 Our implementation is based on concepts of generic programming in C++ and the geometric data types provided by the C++ Computational Geometry Algorithms Library (CGAL).
Styles APA, Harvard, Vancouver, ISO, etc.
6

Saliby, Joe G. « Design and Implementation of Digital Image Transformation Algorithms ». International Journal of Trend in Scientific Research and Development Volume-3, Issue-3 (30 avril 2019) : 623–31. http://dx.doi.org/10.31142/ijtsrd22918.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Michael, Prawin Angel. « FPGA Implementation of Multilevel Space Vector PWM Algorithms ». International Journal of Engineering and Technology 1, no 3 (2009) : 208–12. http://dx.doi.org/10.7763/ijet.2009.v1.39.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Yanwari, Muhammad Irwan, Anton Satria Prabuwono, Tri Raharjo Yudantoro, Nurseno Bayu Aji, Wiktasari et Slamet Handoko. « Priority Scheduling Implementation for Exam Schedule ». Indonesian Journal of Information Systems 5, no 2 (28 février 2023) : 80–89. http://dx.doi.org/10.24002/ijis.v5i2.6871.

Texte intégral
Résumé :
Scheduling is a common problem that has been raised for a long time. Many algorithms have been created for this problem. Some algorithms offer flexibility in terms of constraints and complex operations. Because of that complexity, many algorithms will need huge computation resources and execution time. A platform like a web application has many restrictions such as execution time and computation resources. A complex algorithm is not suited for the web application platform. Priority scheduling is a scheduling algorithm based on a priority queue. Every schedule slot will produce a queue based on the constraints. Each constraint will have a different weight. Weight in queue represents their priority. This algorithm provides a light algorithm that only needs a few computations and execution times. The exam schedule is one of many problems in educational institutions. A web application is a popular platform that can be accessed from everywhere. Many educational institutions use web platforms as their main system platform. Web platforms have some restrictions such as execution time. Due to web platform restrictions, priority scheduling is a suitable algorithm for this platform. In this study, the author tries to implement a priority scheduling algorithm in scheduling cases with a website platform and shows that this algorithm solution can be an alternative for solving scheduling cases with low computational resources.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Afathi, Maan. « Implementation of new hybrid evolutionary algorithm with fuzzy logic control approach for optimization problems ». Eastern-European Journal of Enterprise Technologies 6, no 4 (114) (16 décembre 2021) : 6–14. http://dx.doi.org/10.15587/1729-4061.2021.245222.

Texte intégral
Résumé :
The main purpose of using the hybrid evolutionary algorithm is to reach optimal values and achieve goals that traditional methods cannot reach and because there are different evolutionary computations, each of them has different advantages and capabilities. Therefore, researchers integrate more than one algorithm into a hybrid form to increase the ability of these algorithms to perform evolutionary computation when working alone. In this paper, we propose a new algorithm for hybrid genetic algorithm (GA) and particle swarm optimization (PSO) with fuzzy logic control (FLC) approach for function optimization. Fuzzy logic is applied to switch dynamically between evolutionary algorithms, in an attempt to improve the algorithm performance. The HEF hybrid evolutionary algorithms are compared to GA, PSO, GAPSO, and PSOGA. The comparison uses a variety of measurement functions. In addition to strongly convex functions, these functions can be uniformly distributed or not, and are valuable for evaluating our approach. Iterations of 500, 1000, and 1500 were used for each function. The HEF algorithm’s efficiency was tested on four functions. The new algorithm is often the best solution, HEF accounted for 75 % of all the tests. This method is superior to conventional methods in terms of efficiency
Styles APA, Harvard, Vancouver, ISO, etc.
10

Crutchfield, William Y., et Michael L. Welcome. « Object-Oriented Implementation of Adaptive Mesh Refinement Algorithms ». Scientific Programming 2, no 4 (1993) : 145–56. http://dx.doi.org/10.1155/1993/838429.

Texte intégral
Résumé :
We describe C++ classes that simplify development of adaptive mesh refinement (AMR) algorithms. The classes divide into two groups, generic classes that are broadly useful in adaptive algorithms, and application-specific classes that are the basis for our AMR algorithm. We employ two languages, with C++ responsible for the high-level data structures, and Fortran responsible for low-level numerics. The C++ implementation is as fast as the original Fortran implementation. Use of inheritance has allowed us to extend the original AMR algorithm to other problems with greatly reduced development time.
Styles APA, Harvard, Vancouver, ISO, etc.
11

Vargas-Vera, Maria. « The Implementation of DSSim ». International Journal of Knowledge Society Research 8, no 3 (juillet 2017) : 34–53. http://dx.doi.org/10.4018/ijksr.2017070103.

Texte intégral
Résumé :
This paper presents the decisions taken during the implementation of DSSim (DSSim stands for Similarity based on Dempster-Shafer) our multi-agent ontology mapping system. It describes several types of agents and their roles in the DSSim architecture. These agents are mapping agents which are able to perform either semantic or syntactic similarity. Our architecture is generic as no mappings need to be learned in advance and it could be easily extended by adding new mapping agents in the framework. The new added mapping agents could run different similarity algorithms (either semantic or syntactic). In this way, DSSim could assess which algorithm has a better performance. Additionally, this paper presents the algorithms used in our ontology alignment system DSSim.
Styles APA, Harvard, Vancouver, ISO, etc.
12

Konopel'kin, M. Yu, S. V. Petrov et D. A. Smirnyagina. « Implementation of stochastic signal processing algorithms in radar CAD ». Russian Technological Journal 10, no 5 (21 octobre 2022) : 49–59. http://dx.doi.org/10.32362/2500-316x-2022-10-5-49-59.

Texte intégral
Résumé :
Objectives. In 2020, development work on the creation of a Russian computer-assisted design system for radars (radar CAD) was completed. Radar CAD provides extensive opportunities for creating simulation models for developing the hardware-software complex of radar algorithms, which take into account the specific conditions of aerospace environment observation. The purpose of the present work is to review and demonstrate the capabilities of radar CAD in terms of implementing and testing algorithms for processing stochastic signals.Methods. The work is based on the mathematical apparatus of linear algebra. Analysis of algorithms characteristics was carried out using the simulation method.Results. A simulation model of a sector surveillance radar with a digital antenna array was created in the radar CAD visual functional editor. The passive channel included the following algorithms: algorithm for detecting stochastic signals; algorithm for estimating the number of stochastic signals; direction finding algorithm for stochastic signal sources; adaptive spatial filtering algorithm. In the process of simulation, the algorithms for detecting and estimating the number of stochastic signals produced a correct detection sign and an estimate of the number of signals. The direction-finding algorithm estimated the angular position of the sources with an accuracy of fractions of degrees. The adaptive spatial filtering algorithm suppressed interfering signals to a level below the antenna's intrinsic noise power.Conclusions. The processing of various types of signals can be simulated in detail on the basis of the Russian radar CAD system for the development of functional radar models. According to the results of the simulation, coordinates of observing objects were obtained and an assessment of the effectiveness of the algorithms was given. The obtained results are fully consistent with the theoretical prediction. The capabilities of radar CAD systems demonstrated in this work can be used by specialists in the field of radar and signal processing.
Styles APA, Harvard, Vancouver, ISO, etc.
13

Jing, Xiaoqian, et Haihe Shi. « A New Implementation of Genome Rearrangement Problem ». Journal of Healthcare Engineering 2021 (23 janvier 2021) : 1–9. http://dx.doi.org/10.1155/2021/6692775.

Texte intégral
Résumé :
Unsigned reverse genome rearrangement is an important part of bioinformatics research, which is widely used in biological similarity and homology analysis, revealing biological inheritance, variation, and evolution. Branch and bound, simulated annealing, and other algorithms in unsigned reverse genome rearrangement algorithm are rare in practical application because of their huge time and space consumption, and greedy algorithms are mostly used at present. By deeply analyzing the domain of unsigned reverse genome rearrangement algorithm based on greedy strategy (unsigned reverse genome rearrangement algorithm (URGRA) based on greedy strategy), the domain features are modeled, and the URGRA algorithm components are interactively designed according to the production programming method. With the support of the PAR platform, the algorithm component library of the URGRA is formally realized, and the concrete algorithm is generated by assembly, which improves the reliability of the assembly algorithm.
Styles APA, Harvard, Vancouver, ISO, etc.
14

Tekdas, Onur, Wei Yang et Volkan Isler. « Robotic Routers : Algorithms and Implementation ». International Journal of Robotics Research 29, no 1 (19 mai 2009) : 110–26. http://dx.doi.org/10.1177/0278364909105053.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
15

Beltr�n, Jos� R., et Fernando A. Beltr�n. « Matlab Implementation of Reverberation Algorithms ». Journal of New Music Research 31, no 2 (1 juin 2002) : 153–61. http://dx.doi.org/10.1076/jnmr.31.2.153.8096.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
16

Schreiber, R. « Implementation of adaptive array algorithms ». IEEE Transactions on Acoustics, Speech, and Signal Processing 34, no 5 (octobre 1986) : 1038–45. http://dx.doi.org/10.1109/tassp.1986.1164943.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
17

Ramos-hernandez, D. N., M. O. Tokhi, J. M. Bass et A. R. Browne. « Parallel Implementation of Control Algorithms ». IFAC Proceedings Volumes 31, no 4 (avril 1998) : 167–72. http://dx.doi.org/10.1016/s1474-6670(17)42152-5.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
18

Bergman, S., et S. Ljung. « Implementation of Parameter Estimation Algorithms ». IFAC Proceedings Volumes 21, no 10 (août 1988) : 183–88. http://dx.doi.org/10.1016/b978-0-08-036620-3.50036-3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
19

Leontiev, A. N., E. Yu Leontieva, I. G. Selezneva et A. S. Sukhova. « Digitalization of mediation : implementation algorithms ». Право и государство : теория и практика, no 1 (2023) : 137–39. http://dx.doi.org/10.47643/1815-1337_2023_1_137.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
20

Gamby, Ask, et Jyrki Katajainen. « Convex-Hull Algorithms : Implementation, Testing and Experimentation ». Algorithms 11, no 12 (28 novembre 2018) : 195. http://dx.doi.org/10.3390/a11120195.

Texte intégral
Résumé :
From a broad perspective, we study issues related to implementation, testing, and experimentation in the context of geometric algorithms. Our focus is on the effect of quality of implementation on experimental results. More concisely, we study algorithms that compute convex hulls for a multiset of points in the plane. We introduce several improvements to the implementations of the studied algorithms: plane-sweep, torch, quickhull, and throw-away. With a new set of space-efficient implementations, the experimental results—in the integer-arithmetic setting—are different from those of earlier studies. From this, we conclude that utmost care is needed when doing experiments and when trying to draw solid conclusions upon them.
Styles APA, Harvard, Vancouver, ISO, etc.
21

Amouzou, Gildas Yaovi, et Azzeddine Soulaïmani. « Numerical Algorithms for Elastoplacity : Finite Elements Code Development and Implementation of the Mohr–Coulomb Law ». Applied Sciences 11, no 10 (19 mai 2021) : 4637. http://dx.doi.org/10.3390/app11104637.

Texte intégral
Résumé :
Two numerical algorithms for solving elastoplastic problems with the finite element method are presented. The first deals with the implementation of the return mapping algorithm and is based on a fixed-point algorithm. This method rewrites the system of elastoplasticity non-linear equations in a form adapted to the fixed-point method. The second algorithm relates to the computation of the elastoplastic consistent tangent matrix using a simple finite difference scheme. A first validation is performed on a nonlinear bar problem. The results obtained show that both numerical algorithms are very efficient and yield the exact solution. The proposed algorithms are applied to a two-dimensional rockfill dam loaded in plane strain. The elastoplastic tangent matrix is calculated by using the finite difference scheme for Mohr–Coulomb’s constitutive law. The results obtained with the developed algorithms are very close to those obtained via the commercial software PLAXIS. It should be noted that the algorithm’s code, developed under the Matlab environment, offers the possibility of modeling the construction phases (i.e., building layer by layer) by activating the different layers according to the imposed loading. This algorithmic and implementation framework allows to easily integrate other laws of nonlinear behaviors, including the Hardening Soil Model.
Styles APA, Harvard, Vancouver, ISO, etc.
22

Milano, Marianna, Pietro Hiram Guzzi et Mario Cannataro. « Design and Implementation of New Local Alignment Algorithm for Multilayer Networks ». Entropy 24, no 9 (9 septembre 2022) : 1272. http://dx.doi.org/10.3390/e24091272.

Texte intégral
Résumé :
Network alignment (NA) is a popular research field that aims to develop algorithms for comparing networks. Applications of network alignment span many fields, from biology to social network analysis. NA comes in two forms: global network alignment (GNA), which aims to find a global similarity, and LNA, which aims to find local regions of similarity. Recently, there has been an increasing interest in introducing complex network models such as multilayer networks. Multilayer networks are common in many application scenarios, such as modelling of relations among people in a social network or representing the interplay of different molecules in a cell or different cells in the brain. Consequently, the need to introduce algorithms for the comparison of such multilayer networks, i.e., local network alignment, arises. Existing algorithms for LNA do not perform well on multilayer networks since they cannot consider inter-layer edges. Thus, we propose local alignment of multilayer networks (MultiLoAl), a novel algorithm for the local alignment of multilayer networks. We define the local alignment of multilayer networks and propose a heuristic for solving it. We present an extensive assessment indicating the strength of the algorithm. Furthermore, we implemented a synthetic multilayer network generator to build the data for the algorithm’s evaluation.
Styles APA, Harvard, Vancouver, ISO, etc.
23

RANA, OMER F. « AUTOMATING PARALLEL IMPLEMENTATION OF NEURAL LEARNING ALGORITHMS ». International Journal of Neural Systems 10, no 03 (juin 2000) : 227–41. http://dx.doi.org/10.1142/s012906570000020x.

Texte intégral
Résumé :
Neural learning algorithms generally involve a number of identical processing units, which are fully or partially connected, and involve an update function, such as a ramp, a sigmoid or a Gaussian function for instance. Some variations also exist, where units can be heterogeneous, or where an alternative update technique is employed, such as a pulse stream generator. Associated with connections are numerical values that must be adjusted using a learning rule, and and dictated by parameters that are learning rule specific, such as momentum, a learning rate, a temperature, amongst others. Usually, neural learning algorithms involve local updates, and a global interaction between units is often discouraged, except in instances where units are fully connected, or involve synchronous updates. In all of these instances, concurrency within a neural algorithm cannot be fully exploited without a suitable implementation strategy. A design scheme is described for translating a neural learning algorithm from inception to implementation on a parallel machine using PVM or MPI libraries, or onto programmable logic such as FPGAs. A designer must first describe the algorithm using a specialised Neural Language, from which a Petri net (PN) model is constructed automatically for verification, and building a performance model. The PN model can be used to study issues such as synchronisation points, resource sharing and concurrency within a learning rule. Specialised constructs are provided to enable a designer to express various aspects of a learning rule, such as the number and connectivity of neural nodes, the interconnection strategies, and information flows required by the learning algorithm. A scheduling and mapping strategy is then used to translate this PN model onto a multiprocessor template. We demonstrate our technique using a Kohonen and backpropagation learning rules, implemented on a loosely coupled workstation cluster, and a dedicated parallel machine, with PVM libraries.
Styles APA, Harvard, Vancouver, ISO, etc.
24

Syamsuddin, Irfan, Siska Ihdianty, Eddy Tungadi, Kasim Kasim et Irawan Irawan. « XTEA CRYPTOGRAPHY IMPLEMENTATION IN ANDROID CHATTING APP ». Journal of Information Technology and Its Utilization 3, no 2 (22 décembre 2020) : 36. http://dx.doi.org/10.30818/jitu.3.2.3622.

Texte intégral
Résumé :
Information security plays a significant role in information society. Cryptography is a key proof of concept to increasing the security of information assets and has been deployed in various algorithms. Among cryptography algorithms is Extended Tiny Encryption Algorithm. This study aims to describe a recent Android Apps to realize XTEA Cryptography in mobile form. In addition, a thorough example is presented to enable readers gain understanding on how it works within our Android Apps.
Styles APA, Harvard, Vancouver, ISO, etc.
25

NGASSAM, ERNEST KETCHA, DERRICK G. KOURIE et BRUCE W. WATSON. « ON IMPLEMENTATION AND PERFORMANCE OF TABLE-DRIVEN DFA-BASED STRING PROCESSORS ». International Journal of Foundations of Computer Science 19, no 01 (février 2008) : 53–70. http://dx.doi.org/10.1142/s012905410800553x.

Texte intégral
Résumé :
Table-driven (TD) DFA-based string processing algorithms are examined from a number of vantage points. Firstly, various strategies for implementing such algorithms in a cache-efficient manner are identified. The denotational semantics of such algorithms is encapsulated in a function whose various arguments are associated with each implementation strategy. This formal view of the implementation strategies suggests twelve different algorithms, each blending together the implementation strategies in a particular way. The performance of these algorithms is examined in against a set of artificially generated data. Results indicate a number of cases where the new algorithms outperform the traditional TD algorithm.
Styles APA, Harvard, Vancouver, ISO, etc.
26

Deepika, K., M. Pavan Sai Nagenddra, M. Vamshi Ganesh et N. Naresh. « Implementation of Credit Card Fraud Detection Using Random Forest Algorithm ». International Journal for Research in Applied Science and Engineering Technology 10, no 3 (31 mars 2022) : 797–804. http://dx.doi.org/10.22214/ijraset.2022.40702.

Texte intégral
Résumé :
Abstract: Credit card fraud processing is presently the most frequently arising problem in the present world. This is due to the rise in both online transaction and ecommerce platforms. To detect these fraudulent activities the credit card fraud detection system was introduced, this project main aim is to focus on the machine learning algorithms. The voting based classification algorithm approach is applied for credit card fraud detection. We use different types of classification algorithms such as SVM, Naïve bayes and Random forest. We consider their results based on confusion matrix for the above classification algorithms. We analyze their performance based on accuracy, precision, recall and f1-score. We compare random forest algorithm with other algorithm. We considered random forest algorithm has greatest accuracy, precision, recall and F1-score, considered as the best algorithm that is used to detect the fraud. Keywords: Fraud detection, Naive Bayes, SVM, and Random Forest.
Styles APA, Harvard, Vancouver, ISO, etc.
27

Nagel, Everton, Ricardo Melo Czekster, Thais Webber et César Augusto Missio Marcon. « A Framework Prototype for Multithreaded Implementation Over Micro-Controllers ». Journal of Integrated Circuits and Systems 14, no 1 (29 avril 2019) : 1–10. http://dx.doi.org/10.29292/jics.v14i1.39.

Texte intégral
Résumé :
Multithreading is pervasive in embedded system applications development. The applications requirements are becoming more rigorous, demanding the execution of concurrent tasks that must also take into account modularity and flexibility. An important part of the operating systems development concerns the implementation of scheduling algorithms. In an embedded system context, it is essential to consider that the scheduling algorithm heavily influences application behavior. Due to restricted and finite hardware resources, it is important to evaluate the use of flexible algorithms to guarantee efficiency. Currently, projects for embedded operating systems do exist for microcontrollers’ devices that implement scheduling algorithms, however, the developer cannot change or add new scheduling policies without implementing kernel tweaks and modifications. The alternatives are not flexible when choosing the scheduling algorithm according to the application needs. This imposes restrictions to many systems, forcing them to run specific static scheduling algorithms because no other options are available. The objective of this work concerns the design and development of a framework that implements a microkernel with a modular scheduler unit, allowing the execution of tailored algorithms according to the application profile. The idea is to provide a flexible platform to conveniently select the most appropriated algorithm. We have employed low capacity hardware to implement multithreading patterns corresponding to sets of concurrent tasks, demonstrating the strengths of adopting our approach. Our results show that the use of modern techniques that combine modularity, multithreading, and scheduling methods for embedded systems yield best executions when compared to its sequential counterparts.
Styles APA, Harvard, Vancouver, ISO, etc.
28

V. Vilasini, V. Vasudevan, S. Manuj Nanthan et K. Lakshmi Kalpana Roy. « Analysis and Implementation of 3-D Transpositional Cipher Algorithm Based on Rubik’s Cube Mechanism ». December 2022 4, no 4 (31 janvier 2023) : 283–95. http://dx.doi.org/10.36548/jscp.2022.4.007.

Texte intégral
Résumé :
The algorithms that are used for encrypting the text information for security purpose are referred as encryption algorithms. They are widely employed for the application on data transmission over networks. This is seen as a necessary part of data transmission since confidentiality and data privacy are important factors. Different encryption algorithms have different complexities, speeds of execution, and degrees of security. The Advanced Encryption Standard (AES) is one of the algorithms acknowledged by the U.S. government and other major organizations. The AES algorithm guarantees high security since there is no known public attack that can crack it. The Blowfish algorithm on the other hand is very fast but less secure. The encryption algorithms in the average zone of these two algorithms are highly useful for the transmission of general information among people. Such an algorithm also guarantees a good amount of speed as well as more security. Non-conventional algorithms such as transpositional cipher based on Rubik’s Cube mechanism can be seen as a viable option to use in common applications. These algorithms can be further deepened with the help of more complex key generation parts that can be done to enhance the security of the data. This paper focuses on analytically evaluating if this algorithm can be treated as a viable replacement in an application compared to other algorithms. Moreover, this research covers some pros and cons noted while evaluating.
Styles APA, Harvard, Vancouver, ISO, etc.
29

Kaur, Prabhjot, et Robin Parkash Mathur. « Implementation and Analysis of Clustering Algorithms in Data Mining ». INTERNATIONAL JOURNAL OF COMPUTERS & ; TECHNOLOGY 6, no 1 (30 mai 2013) : 232–36. http://dx.doi.org/10.24297/ijct.v6i1.4448.

Texte intégral
Résumé :
Data mining plays a very important role in information industry and in society due to the presence of huge amount of data. Organizations in the whole world are already aware about data mining. Data mining is the process which uses various kinds of data analysis tools to obtain patterns which also referred to as knowledge discovery from data. Clustering is called unsupervised learning algorithm as groups are not predefined but defined by the data. There are so many research areas in data mining. This paper is focusing on performance and evaluation of clustering algorithm: K-means, SOM and HAC. Evaluations of these three algorithms are purely based on the survey based analysis. These algorithms are analyzed by applying on the data set of banking which is a very high dimensional data. Performances of these algorithms are also compared with each other. Our results indicate that SOM technique is better than k-means and as good as or better than the hierarchical clustering technique. We have also generated one code in Orange Python which is the enhanced algorithm based on the hybrid approach of SOM, K-means and HAC.
Styles APA, Harvard, Vancouver, ISO, etc.
30

S. Awati, Jayashree, Dr M. R. Patil et Dr S.. A. Patil. « Testing and Implementation of Different Wireless Sensor Net-work Algorithms in Agriculture Area ». International Journal of Engineering & ; Technology 7, no 4.20 (28 novembre 2018) : 1. http://dx.doi.org/10.14419/ijet.v7i4.20.22109.

Texte intégral
Résumé :
The paper demonstrates the Testing and Implementation of Different Wireless Sensor Network Algorithms in Agriculture Area. From this algorithm, it will be finalized that which algorithm is more suitable in agriculture area. Agriculture areas are large areas geographically, so to monitor agriculture parameters the wireless sensor networks are more suitable. Graham, Jevis, LPCN l algorithms explained and one personal algorithm implemented. All the results of algorithms are explained in the paper. The results are obtained using wireless network simulator.
Styles APA, Harvard, Vancouver, ISO, etc.
31

Thirumala Rao, B., M. Susmitha, T. Swathi et G. Akhil. « Implementation Of Hybrid Scheduler In Hadoop ». International Journal of Engineering & ; Technology 7, no 2.7 (18 mars 2018) : 868. http://dx.doi.org/10.14419/ijet.v7i2.7.11084.

Texte intégral
Résumé :
The paper focusses on priority based round robin scheduling algorithm for scheduling jobs in Hadoop environment. By Using this Proposed Scheduling Algorithm it reduces the starvation of jobs. And the advantage of priority scheduling is that the process with the highest priority will be executed first. Combining the both strategies of round robin and priority scheduling algorithm a optimized algorithm is to be implemented. Which works more efficiently even after considering all the parameters of scheduling algorithm. This proposed algorithm is also compared with existing round robin and priority scheduling algorithms.
Styles APA, Harvard, Vancouver, ISO, etc.
32

Fugui, Luo, Qin Yunchu et Li Mingzhen. « Research and Implementation of Medical Image Edge Detection Algorithm ». Tobacco Regulatory Science 7, no 5 (30 septembre 2021) : 3866–77. http://dx.doi.org/10.18001/trs.7.5.1.159.

Texte intégral
Résumé :
Medical imaging has become an important reference for the diagnosis of various diseases, and the role of medical imaging will become more and more important in the future. The interpretation of medical images is of paramount importance. With the continuous development of medical imaging technology, image interpretation has become more and more important. At present, it is directly inferred by doctors that in order to solve problems more effectively and deal with fuzzy data, it is necessary to research and implement an algorithm-based medical image edge detection assistant system. The current mainstream algorithms for edge detection include: Roberts, Sobel, Prewitt, etc. Most of these algorithms construct operators for small neighborhood pixels of the original image. The problem is that the algorithm is relatively sensitive to noise in the image and does not automatically select the appropriate threshold, resulting in a result that is not as expected. This is a disadvantage of current algorithms. The thesis elaborates on the theory and algorithm of image edge detection. At the same time, from the perspective of the original edge detection algorithm, the Canny algorithm is mainly studied, and the optimized MTM algorithm and Ostu algorithm are combined to study and optimize in the filtering denoising research. Finally, the algorithm is implemented in C++ language, which realizes the automatic extraction of the edge function of medical images under noise conditions. The improved algorithm performs an edge replacement effect change complared to the conventional algorithm.
Styles APA, Harvard, Vancouver, ISO, etc.
33

Mredula, K. P., et D. C. Vakaskar. « Haar Wavelet Implementation to Various Partial Differential Equations ». European Journal of Engineering Research and Science 2, no 3 (30 mars 2017) : 44. http://dx.doi.org/10.24018/ejers.2017.2.3.307.

Texte intégral
Résumé :
The article brings together a series of algorithms with the modification in formulation of solution to various partial differential equations. The algorithms are modified with implementation of Haar Wavelet. Test examples are considered for validation with few cases. Salient features of multi resolution is closely compared with different resolutions. The approach combines well known finite difference and finite element method with wavelets. A detailed description of algorithm is attempted for simplification of the approach.
Styles APA, Harvard, Vancouver, ISO, etc.
34

Mredula, K. P., et D. C. Vakaskar. « Haar Wavelet Implementation to Various Partial Differential Equations ». European Journal of Engineering and Technology Research 2, no 3 (30 mars 2017) : 44–47. http://dx.doi.org/10.24018/ejeng.2017.2.3.307.

Texte intégral
Résumé :
The article brings together a series of algorithms with the modification in formulation of solution to various partial differential equations. The algorithms are modified with implementation of Haar Wavelet. Test examples are considered for validation with few cases. Salient features of multi resolution is closely compared with different resolutions. The approach combines well known finite difference and finite element method with wavelets. A detailed description of algorithm is attempted for simplification of the approach.
Styles APA, Harvard, Vancouver, ISO, etc.
35

Sokolov, Sergey, Andrey Boguslavsky et Sergei Romanenko. « Implementation of the visual data processing algorithms for onboard computing units ». Robotics and Technical Cybernetics 9, no 2 (30 juin 2021) : 106–11. http://dx.doi.org/10.31776/rtcj.9204.

Texte intégral
Résumé :
According to the short analysis of modern experience of hardware and software for autonomous mobile robots a role of computer vision systems in the structure of those robots is considered. A number of configurations of onboard computers and implementation of algorithms for visual data capturing and processing are described. In original configuration space the «algorithms-hardware» plane is considered. For software designing the realtime vision system framework is used. Experiments with the computing module based on the Intel/Altera Cyclone IV FPGA (implementation of the histogram computation algorithm and the Canny's algorithm), with the computing module based on the Xilinx FPGA (implementation of a sparse and dense optical flow algorithms) are described. Also implementation of algorithm of graph segmentation of grayscale images is considered and analyzed. Results of the first experiments are presented.
Styles APA, Harvard, Vancouver, ISO, etc.
36

Anderson, Jeffrey L., et Nancy Collins. « Scalable Implementations of Ensemble Filter Algorithms for Data Assimilation ». Journal of Atmospheric and Oceanic Technology 24, no 8 (1 août 2007) : 1452–63. http://dx.doi.org/10.1175/jtech2049.1.

Texte intégral
Résumé :
Abstract A variant of a least squares ensemble (Kalman) filter that is suitable for implementation on parallel architectures is presented. This parallel ensemble filter produces results that are identical to those from sequential algorithms already described in the literature when forward observation operators that relate the model state vector to the expected value of observations are linear (although actual results may differ due to floating point arithmetic round-off error). For nonlinear forward observation operators, the sequential and parallel algorithms solve different linear approximations to the full problem but produce qualitatively similar results. The parallel algorithm can be implemented to produce identical answers with the state variable prior ensembles arbitrarily partitioned onto a set of processors for the assimilation step (no caveat on round-off is needed for this result). Example implementations of the parallel algorithm are described for environments with low (high) communication latency and cost. Hybrids of these implementations and the traditional sequential ensemble filter can be designed to optimize performance for a variety of parallel computing environments. For large models on machines with good communications, it is possible to implement the parallel algorithm to scale efficiently to thousands of processors while bit-wise reproducing the results from a single processor implementation. Timing results on several Linux clusters are presented from an implementation appropriate for machines with low-latency communication. Most ensemble Kalman filter variants that have appeared in the literature differ only in the details of how a prior ensemble estimate of a scalar observation is updated given an observed value and the observational error distribution. These details do not impact other parts of either the sequential or parallel filter algorithms here, so a variety of ensemble filters including ensemble square root and perturbed observations filters can be used with all the implementations described.
Styles APA, Harvard, Vancouver, ISO, etc.
37

Tassa, Tamir, Tal Grinshpoun et Roie Zivan. « Privacy Preserving Implementation of the Max-Sum Algorithm and its Variants ». Journal of Artificial Intelligence Research 59 (17 juillet 2017) : 311–49. http://dx.doi.org/10.1613/jair.5504.

Texte intégral
Résumé :
One of the basic motivations for solving DCOPs is maintaining agents' privacy. Thus, researchers have evaluated the privacy loss of DCOP algorithms and defined corresponding notions of privacy preservation for secured DCOP algorithms. However, no secured protocol was proposed for Max-Sum, which is among the most studied DCOP algorithms. As part of the ongoing effort of designing secure DCOP algorithms, we propose P-Max-Sum, the first private algorithm that is based on Max-Sum. The proposed algorithm has multiple agents preforming the role of each node in the factor graph, on which the Max-Sum algorithm operates. P-Max-Sum preserves three types of privacy: topology privacy, constraint privacy, and assignment/decision privacy. By allowing a single call to a trusted coordinator, P-Max-Sum also preserves agent privacy. The two main cryptographic means that enable this privacy preservation are secret sharing and homomorphic encryption. In addition, we design privacy-preserving implementations of four variants of Max-Sum. We conclude by analyzing the price of privacy in terns of runtime overhead, both theoretically and by extensive experimentation.
Styles APA, Harvard, Vancouver, ISO, etc.
38

GRAYSON, BRIAN, et ROBERT VAN DE GEIJN. « A HIGH PERFORMANCE PARALLEL STRASSEN IMPLEMENTATION ». Parallel Processing Letters 06, no 01 (mars 1996) : 3–12. http://dx.doi.org/10.1142/s0129626496000029.

Texte intégral
Résumé :
In this paper, we give a practical high performance parallel implementation of Strassen’s algorithm for matrix multiplication. We show how under restricted conditions, this algorithm can be implemented plug compatible with standard parallel matrix multiplication algorithms. Results obtained on a large Intel Paragon system show a 10– 20% reduction in execution time compared to what we believe to be the fastest standard parallel matrix multiplication implementation available at this time.
Styles APA, Harvard, Vancouver, ISO, etc.
39

Nabil, Mohamed, Ashraf A. M. Khalaf et Sara M. Hassan. « Design and implementation of pipelined and parallel AES encryption systems using FPGA ». Indonesian Journal of Electrical Engineering and Computer Science 20, no 1 (1 octobre 2020) : 287. http://dx.doi.org/10.11591/ijeecs.v20.i1.pp287-299.

Texte intégral
Résumé :
<p><span>The information security is one of the most important issues in the design of any communication network.One of the most common encryption algorithms is the Advanced Encryption Standard (AES).The main problem facing the AES algorithm is the high time consumption due to the large number of rounds used for performing the encryption operation. The more time the encryption system consumes to encrypt the data, the more chances the hackers have to break the system.This paper presents two effective algorithms that can be used to solve the mentioned problem and to achieve an effective processing time reduction using pipelined and parallel techniques to perform the encryption steps. These algorithms are based on using certain techniques to make the system able to encrypt many different states (the data will be encrypted) in the same time with no necessity to wait for the previous encryption operation to be completed. These two algorithms are very effective especially for big data size. This paper describes in detail the AES encryption system algorithm and a detailed explanation for the proposed algorithms. Moreover, the research shows the implementation of the three algorithms: the traditional, the pipelined, and the parallel algorithms, and finally a comparison between them.</span></p>
Styles APA, Harvard, Vancouver, ISO, etc.
40

Trella, Anna L., Kelly W. Zhang, Inbal Nahum-Shani, Vivek Shetty, Finale Doshi-Velez et Susan A. Murphy. « Designing Reinforcement Learning Algorithms for Digital Interventions : Pre-Implementation Guidelines ». Algorithms 15, no 8 (22 juillet 2022) : 255. http://dx.doi.org/10.3390/a15080255.

Texte intégral
Résumé :
Online reinforcement learning (RL) algorithms are increasingly used to personalize digital interventions in the fields of mobile health and online education. Common challenges in designing and testing an RL algorithm in these settings include ensuring the RL algorithm can learn and run stably under real-time constraints, and accounting for the complexity of the environment, e.g., a lack of accurate mechanistic models for the user dynamics. To guide how one can tackle these challenges, we extend the PCS (predictability, computability, stability) framework, a data science framework that incorporates best practices from machine learning and statistics in supervised learning to the design of RL algorithms for the digital interventions setting. Furthermore, we provide guidelines on how to design simulation environments, a crucial tool for evaluating RL candidate algorithms using the PCS framework. We show how we used the PCS framework to design an RL algorithm for Oralytics, a mobile health study aiming to improve users’ tooth-brushing behaviors through the personalized delivery of intervention messages. Oralytics will go into the field in late 2022.
Styles APA, Harvard, Vancouver, ISO, etc.
41

Zhang, Xingyi, Bangju Wang, Zhuanlian Ding, Jin Tang et Juanjuan He. « Implementation of Membrane Algorithms on GPU ». Journal of Applied Mathematics 2014 (2014) : 1–7. http://dx.doi.org/10.1155/2014/307617.

Texte intégral
Résumé :
Membrane algorithms are a new class of parallel algorithms, which attempt to incorporate some components of membrane computing models for designing efficient optimization algorithms, such as the structure of the models and the way of communication between cells. Although the importance of the parallelism of such algorithms has been well recognized, membrane algorithms were usually implemented on the serial computing device central processing unit (CPU), which makes the algorithms unable to work in an efficient way. In this work, we consider the implementation of membrane algorithms on the parallel computing device graphics processing unit (GPU). In such implementation, all cells of membrane algorithms can work simultaneously. Experimental results on two classical intractable problems, the point set matching problem and TSP, show that the GPU implementation of membrane algorithms is much more efficient than CPU implementation in terms of runtime, especially for solving problems with a high complexity.
Styles APA, Harvard, Vancouver, ISO, etc.
42

Korf, Richard. « How Do You Know Your Search Algorithm and Code Are Correct ? » Proceedings of the International Symposium on Combinatorial Search 5, no 1 (1 septembre 2021) : 200–201. http://dx.doi.org/10.1609/socs.v5i1.18333.

Texte intégral
Résumé :
Algorithm design and implementation are notoriously error-prone. As researchers, it is incumbent upon us to maximize the probability that our algorithms, their implementations, and the results we report are correct. In this position paper, I argue that the main technique for doing this is confirmation of results from multiple independent sources, and provide a number of concrete suggestions for how to achieve this in the context of combinatorial search algorithms.
Styles APA, Harvard, Vancouver, ISO, etc.
43

Suppes, Trisha, Ellen B. Dennehy, Robert M. A. Hirschfeld, Lori L. Altshuler, Charles L. Bowden, Joseph R. Calabrese, M. Lynn Crismon, Terence A. Ketter, Gary S. Sachs et Alan C. Swann. « The Texas Implementation of Medication Algorithms ». Journal of Clinical Psychiatry 66, no 07 (15 juillet 2005) : 870–86. http://dx.doi.org/10.4088/jcp.v66n0710.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
44

Vishkin, Uzi. « Can parallel algorithms enhance serial implementation ». ACM SIGACT News 22, no 4 (septembre 1991) : 63. http://dx.doi.org/10.1145/126546.126550.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
45

Kang, Jung-Ha, Sung-Jin Ok, Jae Young Kim et Eun-Gi Kim. « Software Implementation of WAVE Security Algorithms ». Journal of the Korea Academia-Industrial cooperation Society 15, no 3 (31 mars 2014) : 1691–99. http://dx.doi.org/10.5762/kais.2014.15.3.1691.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
46

Braun, Gustav. « Digital Image Display : Algorithms and Implementation ». Journal of Electronic Imaging 14, no 1 (1 janvier 2005) : 019901. http://dx.doi.org/10.1117/1.1877521.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
47

Vishkin, Uzi. « Can parallel algorithms enhance serial implementation ? » Communications of the ACM 39, no 9 (septembre 1996) : 88–91. http://dx.doi.org/10.1145/234215.234475.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
48

Sanchez, J., et H. Barral. « Multiprocessor implementation models for adaptive algorithms ». IEEE Transactions on Signal Processing 44, no 9 (1996) : 2319–31. http://dx.doi.org/10.1109/78.536687.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
49

Cooper, Brad, Amy Grogg et Angie Swerlein. « IMPLEMENTATION AND ANALYSIS OF HEMODYNAMIC ALGORITHMS ». Critical Care Medicine 23, Supplement (janvier 1995) : A138. http://dx.doi.org/10.1097/00003246-199501001-00229.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
50

Sklyarov, Valery. « FPGA-based implementation of recursive algorithms ». Microprocessors and Microsystems 28, no 5-6 (août 2004) : 197–211. http://dx.doi.org/10.1016/j.micpro.2004.03.008.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Algorithms and implementation » pour d’autres types de sources :
Thèses Livres
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie