Se connecter

Bibliographies thématiques / Computation rule / Articles de revues

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Computation rule.

Articles de revues sur le sujet « Computation rule »

Auteur : Grafiati

Publié le 2 juin 2025

Mis à jour le 31 juillet 2025

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 « Computation rule ».

À 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

Xiong, Shiyong, Kaiwen Jiang, and Rongsen Wu. "Research on Rule Matching Model Based on Spark." Journal of Physics: Conference Series 2303, no. 1 (2022): 012020. http://dx.doi.org/10.1088/1742-6596/2303/1/012020.

Texte intégral

Résumé :

Abstract Rule engines are widely used in engineering and academic fields because they can flexibly separate facts and rules from the rule matching process. Since the rule matching process is very time-consuming, and the traditional rule matching uses single-computer operation when many facts and rules exceed the computer’s memory and computational capacity limit, it will cause the application to crash and paralyze. To solve the above problems, this paper investigates the Spark framework and Rete algorithm to take advantage of Spark’s in-memory computation to alleviate the time-consuming proble

Styles APA, Harvard, Vancouver, ISO, etc.

2

ASCIA, G., and V. CATANIA. "AN EFFICIENT HARDWARE ARCHITECTURE TO SUPPORT COMPLEX FUZZY REASONING." International Journal on Artificial Intelligence Tools 05, no. 01n02 (1996): 41–60. http://dx.doi.org/10.1142/s0218213096000043.

Texte intégral

Résumé :

The paper presents the design of a VLSI fuzzy processor which is capable of supporting complex fuzzy reasoning. The architecture of the processor is based on a appropriate computational model, whose main features are: capability to cope with rule chaining; pre-processing of inferences to reduce the number of rules to be processed; parallel computation of the degree of activation of the rules; optimized representation of membership function. The processor performance is in the order of 1.5 MFLIPS (256 rule, 8 Fuzzy inputs, 4 output).

Styles APA, Harvard, Vancouver, ISO, etc.

3

Ninagawa, Shigeru. "Power Spectral Analysis of Elementary Cellular Automata." Complex Systems 17, no. 4 (2008): 399–411. http://dx.doi.org/10.25088/complexsystems.17.4.399.

Texte intégral

Résumé :

Spectral analysis of elementary cellular automata is performed. A power spectrum is calculated from the evolution of 88 independent rules starting from random initial configurations. As a result, it is found that rule 110 exhibits 1/f noise during the longest time steps. Rule 110 has proved to be capable of supporting universal computation. These results suggest that there is a relationship between computational universality and 1/f noise in cellular automata.

Styles APA, Harvard, Vancouver, ISO, etc.

4

FREUND, RUDOLF, and MARION OSWALD. "PARTIAL HALTING IN P SYSTEMS." International Journal of Foundations of Computer Science 18, no. 06 (2007): 1215–25. http://dx.doi.org/10.1142/s0129054107005261.

Texte intégral

Résumé :

We consider a new variant of the halting condition in P systems, i.e., a computation in a P system is already called halting if no multiset of rules containing a rule from each set of rules assigned to the membranes is applicable anymore, whereas usually a computation is called halting if no rule is applicable anymore in the whole system. This new variant of partial halting is especially investigated for (catalytic) P systems and antiport P systems working in different derivation modes.

Styles APA, Harvard, Vancouver, ISO, etc.

5

Sathasivam, Saratha. "Applying Different Learning Rules in Neuro-Symbolic Integration." Advanced Materials Research 433-440 (January 2012): 716–20. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.716.

Texte intégral

Résumé :

Pseudo inverse learning rule and new activation unction performance will be evaluated and compared with the primitive learning rule, Hebb rule. Comparisons are made between these three rules to see which rule is better or outperformed other rules in the aspects of computation time, memory and complexity. From the computer simulation that has been carried out, the new activation function performs better than the other two learning methods.

Styles APA, Harvard, Vancouver, ISO, etc.

6

Betzler, N., A. Slinko, and J. Uhlmann. "On the Computation of Fully Proportional Representation." Journal of Artificial Intelligence Research 47 (July 22, 2013): 475–519. http://dx.doi.org/10.1613/jair.3896.

Texte intégral

Résumé :

We investigate two systems of fully proportional representation suggested by Chamberlin Courant and Monroe. Both systems assign a representative to each voter so that the "sum of misrepresentations" is minimized. The winner determination problem for both systems is known to be NP-hard, hence this work aims at investigating whether there are variants of the proposed rules and/or specific electorates for which these problems can be solved efficiently. As a variation of these rules, instead of minimizing the sum of misrepresentations, we considered minimizing the maximal misrepresentation introdu

Styles APA, Harvard, Vancouver, ISO, etc.

7

Peng, Lijun, Xiaojun Duan, and Jubo Zhu. "A New Sparse Gauss-Hermite Cubature Rule Based on Relative-Weight-Ratios for Bearing-Ranging Target Tracking." Modelling and Simulation in Engineering 2017 (2017): 1–11. http://dx.doi.org/10.1155/2017/2783781.

Texte intégral

Résumé :

A new sparse Gauss-Hermite cubature rule is designed to avoid dimension explosion caused by the traditional full tensor-product based Gauss-Hermite cubature rule. Although Smolyak’s quadrature rule can successfully generate sparse cubature points for high dimensional integral, it has a potential drawback that some cubature points generated by Smolyak’s rule have negative weights, which may result in instability for the computation. A relative-weight-ratio criterion based sparse Gauss-Hermite rule is presented in this paper, in which cubature points are kept symmetric in the input space and cor

Styles APA, Harvard, Vancouver, ISO, etc.

8

Kumar, Ashok, and V. M. Malhotra. "A new computation rule for prolog." Information Processing Letters 27, no. 5 (1988): 249–52. http://dx.doi.org/10.1016/0020-0190(88)90087-7.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Barnett, M. P. "Implicit rule formation in symbolic computation." Computers & Mathematics with Applications 26, no. 10 (1993): 35–50. http://dx.doi.org/10.1016/0898-1221(93)90024-p.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Simiński, Krzysztof. "Rule weights in a neuro-fuzzy system with a hierarchical domain partition." International Journal of Applied Mathematics and Computer Science 20, no. 2 (2010): 337–47. http://dx.doi.org/10.2478/v10006-010-0025-3.

Texte intégral

Résumé :

Rule weights in a neuro-fuzzy system with a hierarchical domain partitionThe paper discusses the problem of rule weight tuning in neuro-fuzzy systems with parameterized consequences in which rule weights and the activation of the rules are not interchangeable. Some heuristic methods of rule weight computation in neuro-fuzzy systems with a hierarchical input domain partition and parameterized consequences are proposed. Several heuristics with experimental results showing the advantage of their usage are presented.

Styles APA, Harvard, Vancouver, ISO, etc.

11

Mailhot, Frédéric, and Charles Reiss. "Computing Long-Distance Dependencies in Vowel Harmony." Biolinguistics 1 (December 2, 2007): 028–48. http://dx.doi.org/10.5964/bioling.8587.

Texte intégral

Résumé :

This article develops an explicit procedural model of vowel harmony, and takes steps toward finding a lower bound on the computational power of phonological rules. The focus on formalization and procedural computation allows for simplification in models of representation and the discovery of interesting interactions involving the conditions in rules. It is shown that locality principles are derivable, which motivates the elimination of iterative rule application advocated here. Along the way, a novel analysis of neutral vowels in harmony processes is also provided.

Styles APA, Harvard, Vancouver, ISO, etc.

12

Roychowdhury, Shounak. "Association rule computation using lexicographic order combination." Integrated Computer-Aided Engineering 10, no. 4 (2003): 387–97. http://dx.doi.org/10.3233/ica-2003-10408.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

13

Cook, Matthew. "A Concrete View of Rule 110 Computation." Electronic Proceedings in Theoretical Computer Science 1 (June 25, 2009): 31–55. http://dx.doi.org/10.4204/eptcs.1.4.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

14

ALVIANO, MARIO, and RAFAEL PEÑALOZA. "Fuzzy answer set computation via satisfiability modulo theories." Theory and Practice of Logic Programming 15, no. 4-5 (2015): 588–603. http://dx.doi.org/10.1017/s1471068415000241.

Texte intégral

Résumé :

AbstractFuzzy answer set programming (FASP) combines two declarative frameworks, answer set programming and fuzzy logic, in order to model reasoning by default over imprecise information. Several connectives are available to combine different expressions; in particular the Gödel and Łukasiewicz fuzzy connectives are usually considered, due to their properties. Although the Gödel conjunction can be easily eliminated from rule heads, we show through complexity arguments that such a simplification is infeasible in general for all other connectives. The paper analyzes a translation of FASP program

Styles APA, Harvard, Vancouver, ISO, etc.

15

Zhao, Xishun, and Decheng Ding. "Some Algorithms for Extension Computation of Nonmonotonic Rule Systems." Fundamenta Informaticae 48, no. 1 (2001): 93–106. https://doi.org/10.3233/fun-2001-48107.

Texte intégral

Résumé :

In this paper, we will place our emphasis on the problem of existence of extensions and on finding more efficient algorithms for computing extensions of nonmonotonic rule systems. First, in order to dedicate further research into nonmonotonic rule systems a new characterization and some new results are given. This characterization and these results lead to new algorithms for computing extensions. Second, a class of nonmonotonic rule systems, called regular nonmonotonic rule systems, is developed. The existence of extensions and semi-monotonicity of regular nonmonotonic rule systems are proved.

Styles APA, Harvard, Vancouver, ISO, etc.

16

Zhang, Xingyi, Xiangxiang Zeng, Bin Luo, and Linqiang Pan. "On Some Classes of Sequential Spiking Neural P Systems." Neural Computation 26, no. 5 (2014): 974–97. http://dx.doi.org/10.1162/neco_a_00580.

Texte intégral

Résumé :

Spiking neural P systems (SN P systems) are a class of distributed parallel computing devices inspired by the way neurons communicate by means of spikes; neurons work in parallel in the sense that each neuron that can fire should fire, but the work in each neuron is sequential in the sense that at most one rule can be applied at each computation step. In this work, with biological inspiration, we consider SN P systems with the restriction that at each step, one of the neurons (i.e., sequential mode) or all neurons (i.e., pseudo-sequential mode) with the maximum (or minimum) number of spikes am

Styles APA, Harvard, Vancouver, ISO, etc.

17

TOMITA, KOHJI, HARUHISA KUROKAWA, and SATOSHI MURATA. "AUTOMATIC GENERATION OF SELF-REPLICATING PATTERNS IN GRAPH AUTOMATA." International Journal of Bifurcation and Chaos 16, no. 04 (2006): 1011–18. http://dx.doi.org/10.1142/s0218127406015258.

Texte intégral

Résumé :

Graph automata define symbol dynamics of graph structures, which are capable of generating structures in addition to describing state transition. Rules of the graph automata are uniform and are therefore suitable for evolutionary computation. This paper shows that various self-replications are possible in graph automata, and that evolutionary computation is applicable to automatic rule generation to obtain self-replicating patterns of graph automata.

Styles APA, Harvard, Vancouver, ISO, etc.

18

Vincze, Dávid, and Szilveszter Kovács. "Performance Optimization of the Fuzzy Rule Interpolation Method “FIVE”." Journal of Advanced Computational Intelligence and Intelligent Informatics 15, no. 3 (2011): 313–20. http://dx.doi.org/10.20965/jaciii.2011.p0313.

Texte intégral

Résumé :

Fuzzy Rule Interpolation (FRI) methods are efficient structures for knowledge-representation with relatively few rules. In spite of their good knowledge representation efficiency, their high computational demand makes the FRI methods hardly suitable for embedded real-time applications, for which short reasoning time has a high importance. On the other hand, the fact that currently available devices have increased computational power gives the FRI methods an opportunity to appear in real-time embedded applications. Therefore, the need for a low-computation and lowresource-demand FRI method is e

Styles APA, Harvard, Vancouver, ISO, etc.

19

Gries, David, Adriano Pascoletti, and Luigi Sbriz. "Horner's rule and the computation of linear recurrences." Information Processing Letters 25, no. 4 (1987): 237–40. http://dx.doi.org/10.1016/0020-0190(87)90168-2.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

20

Aman, Bogdan, and Gabriel Ciobanu. "Reversible computation in nature inspired rule-based systems." Journal of Membrane Computing 2, no. 4 (2020): 246–54. http://dx.doi.org/10.1007/s41965-020-00053-z.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

21

Chen, Xiang, Xue Feng Zhou, and Yong Zhang. "An Interestingness Measure and Computation Method of Association Rules Based on Frequent Itemsets Relatedness." Applied Mechanics and Materials 71-78 (July 2011): 4039–43. http://dx.doi.org/10.4028/www.scientific.net/amm.71-78.4039.

Texte intégral

Résumé :

To address inadequacy of association rules interestingness measure method currently, we present a novel method to measure interestingness with relatedness among items in frequent itemsets. It firstly computed relatedness between frequent k-itemsets and each subset of frequent 2-itemsets, which is a linear combination of Complementarity Intensity (CI), Substitutability Intensity (SI) and Mutual Interaction (MI). The mean of relatedness of all frequent 2-itemsets subsets was regarded as relatedness of frequent k-itemsets. Finally weighted computation method of association rule interestingness wa

Styles APA, Harvard, Vancouver, ISO, etc.

22

Paichit, Piyaphon, and Wilasinee Peerajit. "Development of a Numerical Approach to Evaluate the Performance of the CUSUM Control Chart for a Long Memory SARFIMA Model." WSEAS TRANSACTIONS ON SYSTEMS AND CONTROL 20 (May 30, 2025): 172–84. https://doi.org/10.37394/23203.2025.20.20.

Texte intégral

Résumé :

Assessing the performance of the cumulative sum (CUSUM) control chart is a vital component of statistical process control. This assessment frequently necessitates the approximation of the average run length (ARL) through numerical integration equation (NIE) approaches involving the Midpoint, Trapezoidal, Gauss-Legendre Quadrature Rule, or Simpson's Rule. The focus of this study is evaluating the performance of the CUSUM control chart for a seasonal time series process, specifically long memory Seasonal Autoregressive Fractionally Integrated Moving Average (long memory SARFIMA(1, 0, 1)(1, D, 1)

Styles APA, Harvard, Vancouver, ISO, etc.

23

Yuan, Xiao Guang, Dong Zhu Feng, Jian Deng, and Yuan Jie Bai. "Resource-Constrained Wireless Sensor Network Information Decision Fusion in Ocean Environment." Applied Mechanics and Materials 433-435 (October 2013): 229–32. http://dx.doi.org/10.4028/www.scientific.net/amm.433-435.229.

Texte intégral

Résumé :

In order to solve the decision information fusion issues of resource-constrained wireless sensor network, several decision information fusion rules under exponential distribution fading channel are investigated in this paper. At first, optimal likelihood ratio rule is given. The detection performance of this fusion rule is best, however, this rule acquires channel information which is too costly for resource constrained sensor networks. To solve this problem, suboptimal likelihood ratio fusion rule is proposed which requires only the knowledge of channel statistics. In addition, the reduced fo

Styles APA, Harvard, Vancouver, ISO, etc.

24

Zahmani, M. Habib, and B. Atmani. "A Data Mining Based Dispatching Rules Selection System for the Job Shop Scheduling Problem." Journal of Advanced Manufacturing Systems 18, no. 01 (2019): 35–56. http://dx.doi.org/10.1142/s0219686719500021.

Texte intégral

Résumé :

Identifying the best Dispatching Rule in order to minimize makespan in a Job Shop Scheduling Problem is a complex task, since no Dispatching Rule is better than all others in different scenarios, making the selection of a most effective rule which is time-consuming and costly. In this paper, a novel approach combining Data Mining, Simulation, and Dispatching Rules is proposed. The aim is to assign in real-time a set of Dispatching Rules to the machines on the shop floor while minimizing makespan. Experiments show that the suggested approach is effective and reduces the makespan within a range

Styles APA, Harvard, Vancouver, ISO, etc.

25

Dharmani, Bhaveshkumar. "Gram-Charlier A Series Based Extended Rule-of-Thumb for Bandwidth Selection in Univariate Kernel Density Estimation." Austrian Journal of Statistics 51, no. 3 (2022): 141–63. http://dx.doi.org/10.17713/ajs.v51i3.1204.

Texte intégral

Résumé :

Bandwidth parameter estimation in univariate Kernel Density Estimation has traditionally two approaches. Rule(s)-of-Thumb (ROT) achieve ‘quick and dirty’ estimations with some specific assumption for an unknown density. More accurate solve-the-equation-plug-in (STEPI) rules have almost no direct assumption for the unknown density but demand high computation. This article derives a balancing third approach. Extending an assumption of Gaussianity for the unknown density to be estimated in \textit{normal reference} ROT (NRROT) to near Gaussianity, and then expressing the density using Gram-Charli

Styles APA, Harvard, Vancouver, ISO, etc.

26

Aldowaisan, Tariq, and Ali Allahverdi. "Minimizing total tardiness in no-wait flowshops." Foundations of Computing and Decision Sciences 37, no. 3 (2012): 149–62. http://dx.doi.org/10.2478/v10209-011-0009-6.

Texte intégral

Résumé :

AbstractWe address the m-machine no-wait flowshop scheduling problem; where the objective is to minimize total tardiness. To the best of our knowledge, the considered problem has not been addressed so far. We propose heuristic solutions since the problem is NP-hard. Initially, we consider a number of dispatching rules commonly used for the considered objective in other scheduling environments. We identify through computational experiments the best performing dispatching rule; and then propose simulated annealing (SA) and genetic algorithms (GA) by using the best performing dispatching rule as

Styles APA, Harvard, Vancouver, ISO, etc.

27

Gedeon, Tamás D., László T. Kóczy, and Alessandro Zorat. "Optimal Size Fuzzy Models." Journal of Advanced Computational Intelligence and Intelligent Informatics 11, no. 3 (2007): 335–41. http://dx.doi.org/10.20965/jaciii.2007.p0335.

Texte intégral

Résumé :

Approximate models using fuzzy rule bases can be made more precise by suitably increasing the size of the rule base and decreasing uncertainty in the rules. A large rule base, however, requires more time for its evaluation and hence the problem arises of determining the size that is good enough for the task at hand, but allows as fast as possible reasoning using the rule base. This trade-off between computation time and precision is significant whenever a prediction is made which can become “out of date” or “too old” if not used in time. The trade off is considered here in the context of track

Styles APA, Harvard, Vancouver, ISO, etc.

28

Schaad, L. J., Laimutis Bytautas, and K. N. Houk. "Article." Canadian Journal of Chemistry 77, no. 5-6 (1999): 875–78. http://dx.doi.org/10.1139/v99-066.

Texte intégral

Résumé :

It has been known since the early work of Bigeleisen that incorporating the Redlich-Teller product rule into isotope-effect equations minimizes the importance of low-frequency vibrations. Similar analysis suggests that errors in low frequencies especially are minimized by the use of the Redlich-Teller rule, though its use improves accuracy at all frequencies. However, in the computation of isotope effects, cancellation between isotopomers caused this advantage to vanish exactly in the case of diatomic reactants or products. It does not do so for all polyatomics, and computational experiments a

Styles APA, Harvard, Vancouver, ISO, etc.

29

Muslimin, Rizal. "Experience Grammar: Creative Space Planning with Generative Graph and Shape for Early Design Stage." Buildings 13, no. 4 (2023): 869. http://dx.doi.org/10.3390/buildings13040869.

Texte intégral

Résumé :

This paper presents a method to synthesise functional relationships and spatial configuration simultaneously using shape and graph computation from shape grammar and space syntax theories. The study revisits seminal works and summarises the compatibilities between shape and graph computation as a set of rules. The rule computation is demonstrated in two cases from hospitality and retail, where current applications, opportunities, and limitations are discussed. The results from the study show that incorporating graph and shape rules allows sequences of functions and spatial arrangements to be d

Styles APA, Harvard, Vancouver, ISO, etc.

30

Andreea V, Cojocaru. "What is the True Value of Fuzzy Reasoning in the Framework of the ‘Human Intelligence’ Linguistic Variable?" International Journal of Physics Research and Applications 8, no. 4 (2025): 065–100. https://doi.org/10.29328/journal.ijpra.1001117.

Texte intégral

Résumé :

Computations are presented in the framework of ‘human intelligence’ linguistic variable. Computation concern fuzzy reasoning i.e. the true value of the implication 'IF…THEN'. Computation reveal high dependence of the true value of a rule on the meaning of fuzzy logic operator 'IF…THEN'. The effect of the incorporation of different kind of understanding of the fuzzy logic expression ‘Intelligent’ in the premises of fuzzy reasoning is presented. This framework makes it possible that in cardiology “severe” and “moderate” pathology may be both be “true “for a given patient.

Styles APA, Harvard, Vancouver, ISO, etc.

31

Zhou, Huiyu, Wei Wei, Kaoru Shimada, Shingo Mabu, and Kotaro Hirasawa. "Time Related Association Rules Mining with Attributes Accumulation Mechanism and its Application to Traffic Prediction." Journal of Advanced Computational Intelligence and Intelligent Informatics 12, no. 5 (2008): 467–78. http://dx.doi.org/10.20965/jaciii.2008.p0467.

Texte intégral

Résumé :

In this paper, we propose a method of association rule mining using Genetic Network Programming (GNP) with time series processing mechanism and attributes accumulation mechanism in order to find time related sequence rules efficiently in association rule extraction systems. GNP, a kind of evolutionary computation, represents solutions using graph structures. Because of the inherent features of GNP, it works well in dynamic environments. In this paper, GNP is applied to generate candidate association rules using the database consisting of a large number of time related attributes. In order to d

Styles APA, Harvard, Vancouver, ISO, etc.

32

Shigeta, Yoshinori, Kiyoshi Akama, Hiroshi Mabuchi, and Hidekatsu Koike. "Converting Constraint Handling Rules to Equivalent Transformation Rules." Journal of Advanced Computational Intelligence and Intelligent Informatics 10, no. 3 (2006): 339–48. http://dx.doi.org/10.20965/jaciii.2006.p0339.

Texte intégral

Résumé :

We present a way to convert constraint handling rules (CHRs) to equivalent transformation rules (ETRs) and demonstrate the correctness of the conversion in equivalent transformation (ET) theory. In the ET computation model, computation is regarded as equivalent transformations of a description. A description is transformed successively by ETRs. Extensively used in the domain of first-order terms, the ET computation model has also been applied to knowledge processing in such data domains as RDF, UML, and XML. A CHR is a multiheaded guarded rule that rewrites constraints into simpler ones until

Styles APA, Harvard, Vancouver, ISO, etc.

33

Meissner, Adam. "Experimental analysis of some computation rules in a simple parallel reasoning system for the ALC description logic." International Journal of Applied Mathematics and Computer Science 21, no. 1 (2011): 83–95. http://dx.doi.org/10.2478/v10006-011-0006-1.

Texte intégral

Résumé :

Experimental analysis of some computation rules in a simple parallel reasoning system for theALCdescription logicA computation rule determines the order of selecting premises during an inference process. In this paper we empirically analyse three particular computation rules in a tableau-based, parallel reasoning system for theALCdescription logic, which is built in the relational programming model in the Oz language. The system is constructed in the lean deduction style, namely, it has the form of a small program containing only basic mechanisms, which assure soundness and completeness of rea

Styles APA, Harvard, Vancouver, ISO, etc.

34

Ke, J., and A. Elbella. "Rule-based Shape Optimization of Disks Subjected to Transient Thermoelastic Loading." Journal of Mechanical Design 116, no. 2 (1994): 419–22. http://dx.doi.org/10.1115/1.2919395.

Texte intégral

Résumé :

This study introduces a rule-based geometric approach to the form optimization of axisymmetric components subjected to transient thermoelastic loading. A finite element algorithm is used for structural analysis and the computation of objective function and design constraints values. To satisfy a prescribed design objective, programmed geometric rules are used to iteratively modify the shape. The posed optimization problem is the minimization of the component’s weight while maintaining the stresses in the structure within allowable limits. A conventional optimization, the penalty function techn

Styles APA, Harvard, Vancouver, ISO, etc.

35

Platov, Alexander J., and Juri I. Platov. "Efficient computation of ship’s wave-making resistance using michell’s integral." Russian Journal of Water Transport, no. 73 (December 20, 2022): 206–15. http://dx.doi.org/10.37890/jwt.vi73.327.

Texte intégral

Résumé :

The aim of the present paper is to find efficient method of computation the wave-making resistance of a ship using mitchell’s integral. The computational schemes described in publications suggest the use of simple quadratures (trapezoidal and Simpson’s rule) with a fixed number of integration’s intervals. This approach assumes manual setup of the algorithm for calculating the wave-making resistance for each new ship and makes it difficult to estimate the error of the obtained results. It is shown that the use of these simple quadratures makes it possible to obtain reliable results, but at the

Styles APA, Harvard, Vancouver, ISO, etc.

36

Chang, Lijun, and Kai Yao. "Maximum k-Plex Computation: Theory and Practice." Proceedings of the ACM on Management of Data 2, no. 1 (2024): 1–26. http://dx.doi.org/10.1145/3639318.

Texte intégral

Résumé :

The k-plex model relaxes the clique model by allowing each vertex to miss up to k neighbors, including the vertex itself. A 1-plex is a clique. Many exact algorithms have been recently designed for finding the k-plex with the largest number of vertices, known as the maximum k-plex computation problem. However, all the existing algorithms, except BS, has the trivial worst-case time complexity of O*(2n) when ignoring polynomial factors. On the other hand, although BS improves the time complexity to O*(βkn) where βk < 2 is a constant depending only on k, its practical performance is not satisf

Styles APA, Harvard, Vancouver, ISO, etc.

37

Bicknell, Brendan A., and Michael Häusser. "A synaptic learning rule for exploiting nonlinear dendritic computation." Neuron 109, no. 24 (2021): 4001–17. http://dx.doi.org/10.1016/j.neuron.2021.09.044.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

38

B, Murugeshwari, Jayakumar C, and Sarukesi K. "Secure Multi Party Computation Technique for Classification Rule Sharing." International Journal of Computer Applications 55, no. 7 (2012): 1–10. http://dx.doi.org/10.5120/8764-2683.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

39

El Hassan, Ismat M. "Irregular Boundary Area Computation by Simpson's 3/8 Rule." Journal of Surveying Engineering 113, no. 3 (1987): 127–32. http://dx.doi.org/10.1061/(asce)0733-9453(1987)113:3(127).

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

40

Kaliyappan, M., and S. Hariharan. "Symbolic Computation of Adomian Polynomials Based on Rach’s Rule." British Journal of Mathematics & Computer Science 5, no. 5 (2015): 562–70. http://dx.doi.org/10.9734/bjmcs/2015/14067.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

41

Li, Jin, and Dehao Yu. "A rectangle rule for the computation of hypersingular integral." IOP Conference Series: Materials Science and Engineering 10 (June 1, 2010): 012115. http://dx.doi.org/10.1088/1757-899x/10/1/012115.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

42

Aziz, Haris. "Computation of the random arrival rule for bankruptcy problems." Operations Research Letters 41, no. 5 (2013): 499–502. http://dx.doi.org/10.1016/j.orl.2013.06.004.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

43

Telikani, Akbar, Amir H. Gandomi, and Asadollah Shahbahrami. "A survey of evolutionary computation for association rule mining." Information Sciences 524 (July 2020): 318–52. http://dx.doi.org/10.1016/j.ins.2020.02.073.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

44

Chang, Lijun. "Efficient Maximum k-Defective Clique Computation with Improved Time Complexity." Proceedings of the ACM on Management of Data 1, no. 3 (2023): 1–26. http://dx.doi.org/10.1145/3617313.

Texte intégral

Résumé :

k-defective cliques relax cliques by allowing up-to k missing edges from being a complete graph. This relaxation enables us to find larger near-cliques and has applications in link prediction, cluster detection, social network analysis and transportation science. The problem of finding the largest k-defective clique has been recently studied with several algorithms being proposed in the literature. However, the currently fastest algorithm KDBB does not improve its time complexity from being the trivial O(2n), and also, KDBB's practical performance is still not satisfactory. In this paper, we a

Styles APA, Harvard, Vancouver, ISO, etc.

45

Takarajima, Itaru, Kiyoshi Akama, Ikumi Imani, and Hiroshi Mabuchi. "Design of Nondeterministic Program Termination Based on the Equivalent Transformation Computation Model." Journal of Advanced Computational Intelligence and Intelligent Informatics 10, no. 3 (2006): 349–61. http://dx.doi.org/10.20965/jaciii.2006.p0349.

Texte intégral

Résumé :

We studied the termination of nondeterministic programs, which play an important, basic role in program synthesis, and provide a foundation for proving program termination. The class of programs we consider here is based on the <I>equivalent transformation (ET)</I> computation model. Computation with this model involves the succesive application of rules to sets of clauses. Since the ET model has more expressive terms and rules than other programming languages, program termination is difficult to prove: we must take into account all possible changes of terms made by various rules.

Styles APA, Harvard, Vancouver, ISO, etc.

46

Cheng, Qiu-Bo, Jing He, Jing Yu, Xiao-Ming Zhao, and Su-Peng Kou. "Polygon sign rules of Majorana fermions in two-dimensional topological superconductors." International Journal of Modern Physics B 30, no. 27 (2016): 1650213. http://dx.doi.org/10.1142/s0217979216502131.

Texte intégral

Résumé :

Recently, Majorana fermions (MFs) have attracted intensive attention due to their exotic statistics and possible applications in topological quantum computation. They are proposed to exist in various two-dimensional (2D) topological systems, such as [Formula: see text] topological superconductor (SC) and nanowire–superconducting hybridization system. In this paper, we point out that Majorana fermions in different topological systems obey different types of polygon sign rules. A numerical approach is described to identify the type of polygon sign rule of the Majorana fermions. Applying the appr

Styles APA, Harvard, Vancouver, ISO, etc.

47

Becker, Florent, Tom Besson, Jérôme Durand-Lose, et al. "Abstract Geometrical Computation 10." ACM Transactions on Computation Theory 13, no. 1 (2021): 1–31. http://dx.doi.org/10.1145/3442359.

Texte intégral

Résumé :

Signal machines form an abstract and idealized model of collision computing. Based on dimensionless signals moving on the real line, they model particle/signal dynamics in Cellular Automata. Each particle, or signal , moves at constant speed in continuous time and space. When signals meet, they get replaced by other signals. A signal machine defines the types of available signals, their speeds, and the rules for replacement in collision. A signal machine A simulates another one B if all the space-time diagrams of B can be generated from space-time diagrams of A by removing some signals and ren

Styles APA, Harvard, Vancouver, ISO, etc.

48

Rajkamal Sarma. "Discovery of Fuzzy and Composite Fuzzy Association Rules in Meteorological Data." Journal of Information Systems Engineering and Management 10, no. 37s (2025): 677–97. https://doi.org/10.52783/jisem.v10i37s.6505.

Texte intégral

Résumé :

Fuzzy Association Rule Mining (FARM) extends traditional ARM by evaluating and pruning rules based on interestingness measures to identify relevant patterns for various applications. The focus of this paper is to explore the application of FARM techniques demonstrating its algorithmic implementation in a meteorological dataset. Three major algorithms known as fuzzy Apriori, FTDA (Fuzzy Transaction Data-Mining Algorithm) and CFARM Composite Fuzzy Association Rule Mining) are experimented and analyzed. The experiment uses a real meteorological dataset spanning twenty years consisting some import

Styles APA, Harvard, Vancouver, ISO, etc.

49

Radillo, Adrian E., Alan Veliz-Cuba, Krešimir Josić, and Zachary P. Kilpatrick. "Evidence Accumulation and Change Rate Inference in Dynamic Environments." Neural Computation 29, no. 6 (2017): 1561–610. http://dx.doi.org/10.1162/neco_a_00957.

Texte intégral

Résumé :

In a constantly changing world, animals must account for environmental volatility when making decisions. To appropriately discount older, irrelevant information, they need to learn the rate at which the environment changes. We develop an ideal observer model capable of inferring the present state of the environment along with its rate of change. Key to this computation is an update of the posterior probability of all possible change point counts. This computation can be challenging, as the number of possibilities grows rapidly with time. However, we show how the computations can be simplified

Styles APA, Harvard, Vancouver, ISO, etc.

50

Company, Rafael, Vera N. Egorova, and Lucas Jódar. "Quadrature Integration Techniques for Random Hyperbolic PDE Problems." Mathematics 9, no. 2 (2021): 160. http://dx.doi.org/10.3390/math9020160.

Texte intégral

Résumé :

In this paper, we consider random hyperbolic partial differential equation (PDE) problems following the mean square approach and Laplace transform technique. Randomness requires not only the computation of the approximating stochastic processes, but also its statistical moments. Hence, appropriate numerical methods should allow for the efficient computation of the expectation and variance. Here, we analyse different numerical methods around the inverse Laplace transform and its evaluation by using several integration techniques, including midpoint quadrature rule, Gauss–Laguerre quadrature and

Styles APA, Harvard, Vancouver, ISO, etc.

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!