Articles de revues : « Functional algorithms »

1

Blelloch, Guy E. « Functional parallel algorithms ». ACM SIGPLAN Notices 45, n^o 9 (27 septembre 2010) : 247. http://dx.doi.org/10.1145/1932681.1863579.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Shurup,, Andrei S. « NUMERICAL COMPARISON OF ITERATIVE AND FUNCTIONAL-ANALYTICAL ALGORITHMS FOR INVERSE ACOUSTIC SCATTERING ». Eurasian Journal of Mathematical and Computer Applications 10, n^o 1 (mars 2022) : 79–99. http://dx.doi.org/10.32523/2306-6172-2022-10-1-79-99.

Texte intégral

Résumé :

Abstract In this work the numerical solution of acoustic tomography problem based on the iterative and functional-analytical algorithms is considered. The mathematical properties of these algorithms were previously described in works of R.G. Novikov for the case of the Schr ̈odinger equation. In the present work, for the case of two-dimensional scalar Helmholtz equation, the efficiency of the iterative algorithm in reconstruction of middle strength scat- terers and advantages of the functional-analytical approach in recovering strong scatterers are demonstrated. A filtering procedure is considered in the space of wave vectors, which additionally increases the convergence of the iterative algorithm. Reconstruction results of sound speed perturbations demonstrate the comparable noise immunity and resolution of the considered algorithms when reconstructing middle strength scatterers. A comparative nu- merical investigation of the iterative and functional-analytical algorithms in inverse acoustic scattering problems is implemented in this work for the first time.

Styles APA, Harvard, Vancouver, ISO, etc.

3

Blelloch, Guy E., et Robert Harper. « Cache efficient functional algorithms ». Communications of the ACM 58, n^o 7 (25 juin 2015) : 101–8. http://dx.doi.org/10.1145/2776825.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

BIRD, RICHARD S. « FUNCTIONAL PEARL Unfolding pointer algorithms ». Journal of Functional Programming 11, n^o 3 (mai 2001) : 347–58. http://dx.doi.org/10.1017/s0956796801003914.

Texte intégral

Résumé :

A fair amount has been written on the subject of reasoning about pointer algorithms. There was a peak about 1980 when everyone seemed to be tackling the formal verification of the Schorr–Waite marking algorithm, including Gries (1979, Morris (1982) and Topor (1979). Bornat (2000) writes: “The Schorr–Waite algorithm is the first mountain that any formalism for pointer aliasing should climb”. Then it went more or less quiet for a while, but in the last few years there has been a resurgence of interest, driven by new ideas in relational algebras (Möeller, 1993), in data refinement Butler (1999), in type theory (Hofmann, 2000; Walker and Morrisett, 2000), in novel kinds of assertion (Reynolds, 2000), and by the demands of mechanised reasoning (Bornat, 2000). Most approaches end up being based in the Floyd–Dijkstra–Hoare tradition with loops and invariant assertions. To be sure, when dealing with any recursively-defined linked structure some declarative notation has to be brought in to specify the problem, but no one to my knowledge has advocated a purely functional approach throughout. Mason (1988) comes close, but his Lisp expressions can be very impure. Möller (1999) also exploits an algebraic approach, and the structure of his paper has much in common with what follows.This pearl explores the possibility of a simple functional approach to pointer manipulation algorithms.

Styles APA, Harvard, Vancouver, ISO, etc.

5

OKASAKI, CHRIS. « Special issue on Algorithmic aspects of functional programming languages ». Journal of Functional Programming 11, n^o 5 (29 août 2001) : 439–40. http://dx.doi.org/10.1017/s0956796801004142.

Texte intégral

Résumé :

Algorithms can be dramatically affected by the language in which they are implemented. An algorithm that is elegant and efficient in one language may be ugly and inefficient in another. If you have ever attempted to implement an assignment-intensive algorithm in a functional programming language, you are probably more familiar with this phenomenon than you ever wanted to be! But this sword does not cut in only one direction. Functional programming languages are wonderfully suited to expressing certain kinds of algorithms in a clean, modular way, and researchers over the last five to ten years have greatly expanded the range of algorithms for which this is true.

Styles APA, Harvard, Vancouver, ISO, etc.

6

Cormode, Graham, S. Muthukrishnan et Ke Yi. « Algorithms for distributed functional monitoring ». ACM Transactions on Algorithms 7, n^o 2 (mars 2011) : 1–20. http://dx.doi.org/10.1145/1921659.1921667.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Bird, R. S. « Functional Pearls Two greedy algorithms ». Journal of Functional Programming 2, n^o 2 (avril 1992) : 237–44. http://dx.doi.org/10.1017/s0956796800000368.

Texte intégral

Résumé :

At the recent TC2 working conference on constructing programs from specifications (Moeller, 1991), I presented the derivation of a functional program for solving a problem posed by Knuth (1990). Slightly simplified, the problem was to construct a shortest decimal fraction representing a given integer multiple of 1/216. Later in the conference – and in a different context – Robert Dewar described a second problem that he had recently set as an examination question. In brief, the problem was to replace sequences of blanks in a file by tab characters wherever possible. Although Knuth's and Dewar's problems appear to have little in common, I suspected that both had the same ‘deep structure’ and were instances of a single general result about greedy algorithms. The purpose of this note is to bring the genral result to light and to unify the treatment of the two problems. We begin by describing the problems more precisely.

Styles APA, Harvard, Vancouver, ISO, etc.

8

Bird, Richard S. « Functional Pearls : Unravelling greedy algorithms ». Journal of Functional Programming 2, n^o 3 (juillet 1992) : 375–85. http://dx.doi.org/10.1017/s0956796800000459.

Texte intégral

Résumé :

In my previous Functional Pearls article (Bird, 1992), I proved a theorem giving conditions under which an optimization problem could be implemented by a greedy algorithm. A greedy algorithm is one that picks a ‘best’ element at each stage. Here, we return to this theorem and extend it in various ways. We then use the theory to solve an intriguing problem about unravelling sequences into a smallest number of ascending subsequences.

Styles APA, Harvard, Vancouver, ISO, etc.

9

DeRose, Tony D., Ronald N. Goldman, Hans Hagen et Stephen Mann. « Functional composition algorithms via blossoming ». ACM Transactions on Graphics 12, n^o 2 (avril 1993) : 113–35. http://dx.doi.org/10.1145/151280.151290.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Gelchinsky, B., E. Landa et V. Shtivelman. « Algorithms of phase and group correlation ». GEOPHYSICS 50, n^o 4 (avril 1985) : 596–608. http://dx.doi.org/10.1190/1.1441935.

Texte intégral

Résumé :

In this paper we consider algorithms of phase and group correlation which are based on different assumptions regarding the character of wave field. In order to construct the correlation algorithm, the wave field is presented as a product of an envelope and a normalized seismogram. Phase correlation is performed on the normalized seismogram, while group correlation is performed on the perigram, a low cut version of the envelope function. The central point of the correlation algorithm is the construction of a functional which characterizes the main correlation properties of the wave field. This functional is computed for different values of parameters which appear in the expressions approximating phase and group traveltime curves. Several types of correlation functionals are considered. The next step of the correlation algorithm is analysis of the previously obtained functionals; this is performed using a system of inequalities based on a number of assumptions regarding the properties of wave fields. The results of this analysis permit us to make a decision regarding the presence of a signal and to estimate the parameters of detected waves. Examples illustrating application of the proposed algorithm to synthetic and field data are presented.

Styles APA, Harvard, Vancouver, ISO, etc.

11

Nigiyan, S. A. « ON INTERPRETATION OF TYPED AND UNTYPED FUNCTIONAL PROGRAMS ». Proceedings of the YSU A : Physical and Mathematical Sciences 52, n^o 2 (246) (15 août 2018) : 119–33. http://dx.doi.org/10.46991/pysu:a/2018.52.2.119.

Texte intégral

Résumé :

In this paper the interpretation algorithms for typed and untyped functional programs are considered. Typed functional programs use variables of any order and constants of order $ \leq 1 $, where constants of order 1 are strongly computable, monotonic functions with indeterminate values of arguments. The basic semantics of the typed functional program is a function with indeterminate values of arguments, which is the main component of its least solution. The interpretation algorithms of typed functional programs are based on substitutions, $ \beta $-reduction and canonical $ \delta $-reduction. The basic semantics of the untyped functional program is the untyped $ \lambda $-term, which is defined by means of the fixed point combinator. The interpretation algorithms of untyped functional programs are based on substitutions and $ \beta $-reduction. Interpretation algorithms are examined for completeness and comparability. It is investigated how the “behavior” of the interpretation algorithm changes after translation of typed functional program into untyped functional program.

Styles APA, Harvard, Vancouver, ISO, etc.

12

Büscher, Nils, Daniel Gis, Volker Kühn et Christian Haubelt. « On the Functional and Extra-Functional Properties of IMU Fusion Algorithms for Body-Worn Smart Sensors ». Sensors 21, n^o 8 (13 avril 2021) : 2747. http://dx.doi.org/10.3390/s21082747.

Texte intégral

Résumé :

In this work, four sensor fusion algorithms for inertial measurement unit data to determine the orientation of a device are assessed regarding their usability in a hardware restricted environment such as body-worn sensor nodes. The assessment is done for both the functional and the extra-functional properties in the context of human operated devices. The four algorithms are implemented in three data formats: 32-bit floating-point, 32-bit fixed-point and 16-bit fixed-point and compared regarding code size, computational effort, and fusion quality. Code size and computational effort are evaluated on an ARM Cortex M0+. For the assessment of the functional properties, the sensor fusion output is compared to a camera generated reference and analyzed in an extensive statistical analysis to determine how data format, algorithm, and human interaction influence the quality of the sensor fusion. Our experiments show that using fixed-point arithmetic can significantly decrease the computational complexity while still maintaining a high fusion quality and all four algorithms are applicable for applications with human interaction.

Styles APA, Harvard, Vancouver, ISO, etc.

13

Luz López García, María, Ricardo García-Ródenas et Antonia González Gómez. « K-means algorithms for functional data ». Neurocomputing 151 (mars 2015) : 231–45. http://dx.doi.org/10.1016/j.neucom.2014.09.048.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

14

Boguchwal, Louis. « Shortest path algorithms for functional environments ». Discrete Optimization 18 (novembre 2015) : 217–51. http://dx.doi.org/10.1016/j.disopt.2015.09.006.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

15

ERWIG, MARTIN. « Inductive graphs and functional graph algorithms ». Journal of Functional Programming 11, n^o 5 (29 août 2001) : 467–92. http://dx.doi.org/10.1017/s0956796801004075.

Texte intégral

Résumé :

We propose a new style of writing graph algorithms in functional languages which is based on an alternative view of graphs as inductively defined data types. We show how this graph model can be implemented efficiently, and then we demonstrate how graph algorithms can be succinctly given by recursive function definitions based on the inductive graph view. We also regard this as a contribution to the teaching of algorithms and data structures in functional languages since we can use the functional-style graph algorithms instead of the imperative algorithms that are dominant today.

Styles APA, Harvard, Vancouver, ISO, etc.

16

Tozoni, O. V. « Functional transformation algorithms in cad systems ». Cybernetics 22, n^o 6 (1987) : 747–58. http://dx.doi.org/10.1007/bf01068691.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

17

Grigoryan, D. A. « ON INCOMPARABILITY OF INTERPRETATION ALGORITHMS OF TYPED FUNCTIONAL PROGRAMS WITH RESPECT TO UNDEFINED VALUE ». Proceedings of the YSU A : Physical and Mathematical Sciences 52, n^o 2 (246) (15 août 2018) : 109–18. http://dx.doi.org/10.46991/pysu:a/2018.52.2.109.

Texte intégral

Résumé :

In the paper the interpretation algorithms of typed functional programs are considered. The interpretation algorithm is based on substitution, $ \beta $-reduction and canonical $ \delta $-reduction. It is shown that seven known interpretation algorithms (FS (of full substitution), PES (of parallel external substitution), LES (of left external substitution), PIS (of parallel inner substitution), LIS (of left inner substitution), ACT (active algorithm), PAS (passive algorithm)) are pairwise incomparable with respect to undefined value ($ \perp $-incomparable).

Styles APA, Harvard, Vancouver, ISO, etc.

18

Ngo, Son Tung, Jafreezal Jaafar, Aziz Abdul Izzatdin, Giang Truong Tong et Anh Ngoc Bui. « Some metaheuristic algorithms for solving multiple cross-functional team selection problems ». PeerJ Computer Science 8 (9 août 2022) : e1063. http://dx.doi.org/10.7717/peerj-cs.1063.

Texte intégral

Résumé :

We can find solutions to the team selection problem in many different areas. The problem solver needs to scan across a large array of available solutions during their search. This problem belongs to a class of combinatorial and NP-Hard problems that requires an efficient search algorithm to maintain the quality of solutions and a reasonable execution time. The team selection problem has become more complicated in order to achieve multiple goals in its decision-making process. This study introduces a multiple cross-functional team (CFT) selection model with different skill requirements for candidates who meet the maximum required skills in both deep and wide aspects. We introduced a method that combines a compromise programming (CP) approach and metaheuristic algorithms, including the genetic algorithm (GA) and ant colony optimization (ACO), to solve the proposed optimization problem. We compared the developed algorithms with the MIQP-CPLEX solver on 500 programming contestants with 37 skills and several randomized distribution datasets. Our experimental results show that the proposed algorithms outperformed CPLEX across several assessment aspects, including solution quality and execution time. The developed method also demonstrated the effectiveness of the multi-criteria decision-making process when compared with the multi-objective evolutionary algorithm (MOEA).

Styles APA, Harvard, Vancouver, ISO, etc.

19

O'NEILL, MELISSA E., et F. WARREN BURTON. « A new method for functional arrays ». Journal of Functional Programming 7, n^o 5 (septembre 1997) : 487–513. http://dx.doi.org/10.1017/s0956796897002852.

Texte intégral

Résumé :

Arrays are probably the most widely used data structure in imperative programming languages, yet functional languages typically only support arrays in a limited manner, or prohibit them entirely. This is not too surprising, since most other mutable data structures, such as trees, have elegant immutable analogues in the functional world, whereas arrays do not. Previous attempts at addressing the problem have suffered from one of three weaknesses, either that they don't support arrays as a persistent data structure (unlike the functional analogues of other imperative data structures), or that the range of operations is too restrictive to support some common array algorithms efficiently, or that they have performance problems. Our technique provides arrays as a true functional analogue of imperative arrays with the properties that functional programmers have come to expect from their data structures. To efficiently support array algorithms from the imperative world, we provide O(1) operations for single-threaded array use. Fully persistent array use can also be provided at O(1) amortized cost, provided that the algorithm satisfies a simple requirement as to uniformity of access. For those algorithms which do not access the array uniformly or single-threadedly, array reads or updates take at most O(log n) amortized time, where n is the size of the array. Experimental results indicate that the overheads of our technique are acceptable in practice for many applications.

Styles APA, Harvard, Vancouver, ISO, etc.

20

XU, YONG-LI, et DI-RONG CHEN. « LEARNING RATES OF REGULARIZED REGRESSION FOR FUNCTIONAL DATA ». International Journal of Wavelets, Multiresolution and Information Processing 07, n^o 06 (novembre 2009) : 839–50. http://dx.doi.org/10.1142/s0219691309003288.

Texte intégral

Résumé :

The study of regularized learning algorithms is a very important issue and functional data analysis extends classical methods. We establish the learning rates of the least square regularized regression algorithm in reproducing kernel Hilbert space for functional data. With the iteration method, we obtain fast learning rate for functional data. Our result is a natural extension for least square regularized regression algorithm when the dimension of input data is finite.

Styles APA, Harvard, Vancouver, ISO, etc.

21

SOHAEE, NASSIM, et CHRISTIAN V. FORST. « IDENTIFICATION OF FUNCTIONAL MODULES IN A PPI NETWORK BY BOUNDED DIAMETER CLUSTERING ». Journal of Bioinformatics and Computational Biology 08, n^o 06 (décembre 2010) : 929–43. http://dx.doi.org/10.1142/s0219720010005221.

Texte intégral

Résumé :

Dense subgraphs of Protein–Protein Interaction (PPI) graphs are assumed to be potential functional modules and play an important role in inferring the functional behavior of proteins. Increasing amount of available PPI data implies a fast, accurate approach of biological complex identification. Therefore, there are different models and algorithms in identifying functional modules. This paper describes a new graph theoretic clustering algorithm that detects densely connected regions in a large PPI graph. The method is based on finding bounded diameter subgraphs around a seed node. The algorithm has the advantage of being very simple and efficient when compared with other graph clustering methods. This algorithm is tested on the yeast PPI graph and the results are compared with MCL, Core-Attachment, and MCODE algorithms.

Styles APA, Harvard, Vancouver, ISO, etc.

22

Salami, F., M. Goetze, J. Leboucher, S. Campos, S. Hagmann et S. I. Wolf. « Determining heel center using functional calibration algorithms ». Gait & ; Posture 97 (septembre 2022) : S157—S158. http://dx.doi.org/10.1016/j.gaitpost.2022.07.104.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

23

Clinger, William D. « The simplicity of cache efficient functional algorithms ». Communications of the ACM 58, n^o 7 (25 juin 2015) : 100. http://dx.doi.org/10.1145/2776827.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

24

Chakravarty, Manuel M. T., Gabriele Keller et Patryk Zadarnowski. « A Functional Perspective on SSA Optimisation Algorithms ». Electronic Notes in Theoretical Computer Science 82, n^o 2 (avril 2004) : 347–61. http://dx.doi.org/10.1016/s1571-0661(05)82596-4.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

25

Blelloch, Guy E., et Robert Harper. « Cache and I/O efficent functional algorithms ». ACM SIGPLAN Notices 48, n^o 1 (23 janvier 2013) : 39–50. http://dx.doi.org/10.1145/2480359.2429077.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

26

Gastegger, Michael, Leticia González et Philipp Marquetand. « Exploring density functional subspaces with genetic algorithms ». Monatshefte für Chemie - Chemical Monthly 150, n^o 2 (14 décembre 2018) : 173–82. http://dx.doi.org/10.1007/s00706-018-2335-3.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

27

Yassouridis, Christina, et Friedrich Leisch. « Benchmarking different clustering algorithms on functional data ». Advances in Data Analysis and Classification 11, n^o 3 (4 juillet 2016) : 467–92. http://dx.doi.org/10.1007/s11634-016-0261-y.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

28

Mannila, Heikki, et Kari-Jouko Räihä. « Algorithms for inferring functional dependencies from relations ». Data & ; Knowledge Engineering 12, n^o 1 (février 1994) : 83–99. http://dx.doi.org/10.1016/0169-023x(94)90023-x.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

29

Abello, Buchsbaum et Westbrook. « A Functional Approach to External Graph Algorithms ». Algorithmica 32, n^o 3 (mars 2002) : 437–58. http://dx.doi.org/10.1007/s00453-001-0088-5.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

30

Elliott, Conal. « Generic functional parallel algorithms : scan and FFT ». Proceedings of the ACM on Programming Languages 1, ICFP (29 août 2017) : 1–25. http://dx.doi.org/10.1145/3110251.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

31

Zijm, W. H. M. « Markovian control problems : Functional equations and algorithms ». European Journal of Operational Research 21, n^o 1 (juillet 1985) : 143–44. http://dx.doi.org/10.1016/0377-2217(85)90104-3.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

32

Malikova, F. U., N. ZH Zhanat, A. K. Saginayeva et R. S. Ryskeldy. « FEATURES OF FACIAL RECOGNITION ». BULLETIN Series of Physics & ; Mathematical Sciences 69, n^o 1 (10 mars 2020) : 374–77. http://dx.doi.org/10.51889/2020-1.1728-7901.67.

Texte intégral

Résumé :

The facial recognition system is used to provide identification and authentication during functional testing. It can also be used to identify people in different situations. This article presents a comparative study of the algorithms used for facial isolation and recognition. Algorithms are general algorithms that match a recognizable face. The concept of each algorithm is explained and a corresponding description is given. In addition, the results of the algorithms are evaluated in a data set and are displayed as graphs for evaluating the effectiveness of each algorithm. Algorithms work with a common data set and display the percentage of functions obtained.

Styles APA, Harvard, Vancouver, ISO, etc.

33

Tikhonravov, A. V., Iu S. Lagutin, A. A. Lagutina, D. V. Lukyanenko, I. V. Kochikov et A. G. Yagola. « COMPARISON OF ALGORITHMS FOR DETERMINING THE THICKNESS OF OPTICAL COATING LAYERS BASED ON THE MONOCHROMATIC MONITORING DATA ». Eurasian Journal of Mathematical and Computer Applications 9, n^o 4 (décembre 2021) : 89–99. http://dx.doi.org/10.32523/2306-6172-2021-9-4-89-99.

Texte intégral

Résumé :

The reverse engineering problem of determining the layer thicknesses of deposited optical coatings from on-line monochromatic measurements is considered. To solve this inverse problem, non-local algorithms are proposed that use all the data accumulated during the deposition process. For the proposed algorithms, the accuracy of solving the inverse problem is compared in the presence of random and systematic errors. It is shown that in the case when the measured data contains only random errors, the best accuracy is provided by the algorithm based on minimizing the discrepancy functional. In the case of systematic errors, the advantage of one the algorithms based on minimizing the variance functionals is demonstrated. Key words: inverse problems, reverse engineering, optical coatings, thin films.

Styles APA, Harvard, Vancouver, ISO, etc.

34

Kieu-Do-Nguyen, Binh, Cuong Pham-Quoc, Ngoc-Thinh Tran, Cong-Kha Pham et Trong-Thuc Hoang. « Low-Cost Area-Efficient FPGA-Based Multi-Functional ECDSA/EdDSA ». Cryptography 6, n^o 2 (10 mai 2022) : 25. http://dx.doi.org/10.3390/cryptography6020025.

Texte intégral

Résumé :

In cryptography, elliptic curve cryptography (ECC) is considered an efficient and secure method to implement digital signature algorithms (DSAs). ECC plays an essential role in many security applications, such as transport layer security (TLS), internet protocol security (IPsec), and wireless sensor networks (WSNs). The proposed designs of ECC hardware implementation only focus on a single ECC variant and use many resources. These proposals cannot be used for resource-constrained applications or for the devices that need to provide multiple levels of security. This work provides a multi-functional elliptic curve digital signature algorithm (ECDSA) and Edwards-curve digital signature algorithm (EdDSA) hardware implementation. The core can run multiple ECDSA/EdDSA algorithms in a single design. The design consumes fewer resources than the other single-functional design, and is not based on digital signal processors (DSP). The experiments show that the proposed core could run up to 112.2 megahertz with Virtex-7 devices while consuming only 10,259 slices in total.

Styles APA, Harvard, Vancouver, ISO, etc.

35

Arnaudov, Rumen, et Ivo Dochev. « Functional generator controlled by internet ». Facta universitatis - series : Electronics and Energetics 16, n^o 1 (2003) : 93–102. http://dx.doi.org/10.2298/fuee0301093a.

Texte intégral

Résumé :

This paper presents a functional generator controlled by Internet. We describe a computer-system architecture, a block diagram of generator and working algorithms. The remote control is realized by computer networks and using the TCP/IP protocols. For that purpose is used "Customer-Server" architecture. The software algorithms is based on Linux operating system Apache web server, MySql database, HTML and PHP languages.

Styles APA, Harvard, Vancouver, ISO, etc.

36

Huang, Xuejing, et Bruno C. d. S. Oliveira. « Distributing intersection and union types with splits and duality (functional pearl) ». Proceedings of the ACM on Programming Languages 5, ICFP (22 août 2021) : 1–24. http://dx.doi.org/10.1145/3473594.

Texte intégral

Résumé :

Subtyping with intersection and union types is nowadays common in many programming languages. From the perspective of logic, the subtyping problem is essentially the problem of determining logical entailment : does a logical statement follow from another one? Unfortunately, algorithms for deciding subtyping and logical entailment with intersections, unions and various distributivity laws can be highly non-trivial. This functional pearl presents a novel algorithmic formulation for subtyping (and logical entailment) in the presence of various distributivity rules between intersections, unions and implications (i.e. function types). Unlike many existing algorithms which first normalize types and then apply a subtyping algorithm on the normalized types, our new subtyping algorithm works directly on source types. Our algorithm is based on two recent ideas: a generalization of subtyping based on the duality of language constructs called duotyping ; and splittable types , which characterize types that decompose into two simpler types. We show that our algorithm is sound, complete and decidable with respect to a declarative formulation of subtyping based on the minimal relevant logic B + . Moreover, it leads to a simple and compact implementation in under 50 lines of functional code.

Styles APA, Harvard, Vancouver, ISO, etc.

37

Danciu, Gabriel Mihail, et Alexandru Dinu. « Coverage Fulfillment Automation in Hardware Functional Verification Using Genetic Algorithms ». Applied Sciences 12, n^o 3 (31 janvier 2022) : 1559. http://dx.doi.org/10.3390/app12031559.

Texte intégral

Résumé :

The functional verification process is one of the most expensive steps in integrated circuit manufacturing. Functional coverage is the most important metric in the entire verification process. By running multiple simulations, different situations of DUT functionality can be encountered, and in this way, functional coverage fulfillment can be improved. However, in many cases it is difficult to reach specific functional situations because it is not easy to correlate the required input stimuli with the expected behavior of the digital design. Therefore, both industry and academia seek solutions to automate the generation of stimuli to reach all the functionalities of interest with less human effort and in less time. In this paper, several approaches inspired by genetic algorithms were developed and tested using three different designs. In all situations, the percentage of stimulus sets generated using well-performing genetic algorithms approaches was higher than the values that resulted when random simulations were employed. In addition, in most cases the genetic algorithm approach reached a higher coverage value per test compared to the random simulation outcome. The results confirmed that in many cases genetic algorithms can outperform constrained random generation of stimuli, that is employed in the classical way of doing verification, considering coverage fulfillment level per verification test.

Styles APA, Harvard, Vancouver, ISO, etc.

38

Turner, M. R., et J. Norbury. « Nonuniqueness in a Single-Column Model for Moist Convection ». Journal of the Atmospheric Sciences 77, n^o 3 (1 mars 2019) : 1001–18. http://dx.doi.org/10.1175/jas-d-19-0045.1.

Texte intégral

Résumé :

Abstract We investigate a moist atmospheric column convection model by considering the atmosphere as a single vertical column of air parcels, each of which contains water vapor. The moist convective adjustment of both air and water mass in the column is considered from an (unstable) initial state to a statically stable final configuration of parcels. Two variations of an algorithm based upon swapping neighboring parcels are compared: after swapping, no parcels remain supersaturated. The results of these algorithms are compared directly with those of the adjustment algorithm of Cheng et al., which adjusts an atmospheric column to achieve the global maximum of a relevant cost functional. Two examples are considered: in the first, the algorithms adjust to similar arrangements, showing that the global maximum of the functional is the dynamically preferred state, while in the second, the algorithms adjust to significantly different states. Thus, we identify a nonuniqueness to the solution to the adjustment problem in terms of local and global cost functional maximizers. We then discuss the relevance of this nonuniqueness to numerical prediction in weather and climate models.

Styles APA, Harvard, Vancouver, ISO, etc.

39

Rauber Du Bois, André, Rodrigo Ribeiro et Maycon Amaro. « A Mechanized Proof of a Textbook Type Unification Algorithm ». Revista de Informática Teórica e Aplicada 27, n^o 3 (18 juin 2020) : 13–24. http://dx.doi.org/10.22456/2175-2745.100968.

Texte intégral

Résumé :

Unification is the core of type inference algorithms for modern functional programming languages, like Haskell and SML. As a first step towards a formalization of a type inference algorithm for such programming languages, we present a formalization in Coq of a type unification algorithm that follows classic algorithms presented in programming language textbooks. We also report on the use of such formalization to build a correct type inference algorithm for the simply typed λ-calculus.

Styles APA, Harvard, Vancouver, ISO, etc.

40

Zharkov, Maksim, Konstantin Veremeenko, Ivan Kuznetsov et Andrei Pronkin. « Experimental Results of Attitude Determination Functional Algorithms Implementation in Strapdown Inertial Navigation System ». Sensors 22, n^o 5 (26 février 2022) : 1849. http://dx.doi.org/10.3390/s22051849.

Texte intégral

Résumé :

Strapdown inertial navigation system (SINS) software developers are usually mainly focused on the attitude determination algorithm design and characteristics. Such an algorithm can be based on different mathematical apparatus. An approach to the derivation of attitude determination algorithm equations in strapdown inertial navigation system is proposed. This algorithm is based on direct heading, pitch, and roll calculation. The qualitative differences between the proposed algorithm and the one using a transformation matrix are noted. The main objective of the paper is direct attitude angles calculation algorithm application possibilities analysis in real SINS operating conditions. The analysis is based on a comparison of the proposed algorithm with another frequently used attitude determination algorithm based on the transformation matrix. Attitude determination algorithms performance investigation results based on car and helicopter experimental tests are presented.

Styles APA, Harvard, Vancouver, ISO, etc.

41

Kholod, Ivan, Mikhail Kupriyanov et Andrey Shorov. « Decomposition of Data Mining Algorithms into Unified Functional Blocks ». Mathematical Problems in Engineering 2016 (2016) : 1–11. http://dx.doi.org/10.1155/2016/8197349.

Texte intégral

Résumé :

The present paper describes the method of creating data mining algorithms from unified functional blocks. This method splits algorithms into independently functioning blocks. These blocks must have unified interfaces and implement pure functions. The method allows us to create new data mining algorithms from existing blocks and improves the existing algorithms by optimizing single blocks or the whole structure of the algorithms. This becomes possible due to a number of important properties inherent in pure functions and hence functional blocks.

Styles APA, Harvard, Vancouver, ISO, etc.

42

Peng, Yu Lou, Yi Gang He et Bin Lin. « Functional Watermarking Algorithm Based on Contourlet Transform and ECC ». Applied Mechanics and Materials 103 (septembre 2011) : 187–93. http://dx.doi.org/10.4028/www.scientific.net/amm.103.187.

Texte intégral

Résumé :

User-defined functional watermarking algorithm was presented based on contourlet transform field and Ellipse Curve Cryptography（ECC） spatial field. First the edge and direction information of image was obtained by contourlet transform, the discrete functional watermarking was embedded into high frequency parts, and the embedding data was avoided to the image edge. ECC encrypts embedding coordinate’s series. Watermarking changes little original image because of less function data, and attends to zero watermarking algorithms. The results show that the algorithm is invisible to watermarking and also has enough robustness to noise and cropping attack.

Styles APA, Harvard, Vancouver, ISO, etc.

43

Nepomnyashchiy, O. V. « On the Correctness of Equivalent Transformations in the Process of Functional-Flow, High-Level VLSI Synthesis ». Informacionnye Tehnologii 29, n^o 1 (19 janvier 2023) : 3–11. http://dx.doi.org/10.17587/it.29.3-11.

Texte intégral

Résumé :

The original method and route of functional-flow synthesis of ultra-large integrated circuits is considered. A way of reducing the degree of parallelism and the original algorithms is presented. When transferring the algorithm to the target platform, the imposed restrictions are taken into account. It is proposed to use the developed methods of formal verification to confirm the adequacy of the results of the transformation We mean to the transformation from the algorithms descried in the functional-flow parallel programming language to the hardware description languages.

Styles APA, Harvard, Vancouver, ISO, etc.

44

Grant, P. W., J. A. Sharp, M. F. Webster et X. Zhang. « Sparse matrix representations in a functional language ». Journal of Functional Programming 6, n^o 1 (janvier 1996) : 143–70. http://dx.doi.org/10.1017/s095679680000160x.

Texte intégral

Résumé :

AbstractThis paper investigates several sparse matrix representation schemes and associated algorithms in Haskell for solving linear systems of equations arising from solving realistic computational fluid dynamics problems using a finite element algorithm. This work complements that of Wainwright and Sexton (1992) in that a Choleski direct solver (with an emphasis on its forward/backward substitution steps) is examined. Experimental evidence comparing time and space efficiency of these matrix representation schemes is reported, together with associated forward/backward substitution implementations. Our results are in general agreement with Wainwright and Sexton's.

Styles APA, Harvard, Vancouver, ISO, etc.

45

Pánovics, János. « A Functional Programming Approach to AI Search Algorithms ». Journal of Information Technology Education : Innovations in Practice 11 (2012) : 353–76. http://dx.doi.org/10.28945/1736.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

46

Chen, Xiaming, Bohao Tang, Jun Fan et Xin Guo. « Online gradient descent algorithms for functional data learning ». Journal of Complexity 70 (juin 2022) : 101635. http://dx.doi.org/10.1016/j.jco.2021.101635.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

47

Zhu, Wangshu, et Andre Rosendo. « A Functional Clipping Approach for Policy Optimization Algorithms ». IEEE Access 9 (2021) : 96056–63. http://dx.doi.org/10.1109/access.2021.3094566.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

48

Files, C. M., et M. A. Perkowski. « New multivalued functional decomposition algorithms based on MDDs ». IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 19, n^o 9 (2000) : 1081–86. http://dx.doi.org/10.1109/43.863648.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

49

Parker, Andrew S., Wei Zheng, Karl E. Griswold et Chris Bailey-Kellogg. « Optimization algorithms for functional deimmunization of therapeutic proteins ». BMC Bioinformatics 11, n^o 1 (2010) : 180. http://dx.doi.org/10.1186/1471-2105-11-180.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

50

Lin, Yen‐Chun, et Ferng‐Ching Lin. « Synthesizing systolic algorithms by three‐level functional programs ». Journal of the Chinese Institute of Engineers 13, n^o 2 (mars 1990) : 135–46. http://dx.doi.org/10.1080/02533839.1990.9677241.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Articles de revues sur le sujet « Functional algorithms »

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