Log in

Relevant bibliographies by topics / Rule modelling / Journal articles

Journal articles on the topic 'Rule modelling'

To see the other types of publications on this topic, follow the link: Rule modelling.

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Rule modelling.'

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

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

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

G, Manju. "Rule-based Cognitive Modelling for Multimodal Intelligent Tutoring Systems." International Journal of Psychosocial Rehabilitation 24, no. 1 (January 20, 2020): 1754–60. http://dx.doi.org/10.37200/ijpr/v24i1/pr200275.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bellet, Thomas, Agnès Arnould, and Pascale Le Gall. "Rule-based transformations for geometric modelling." Electronic Proceedings in Theoretical Computer Science 48 (February 11, 2011): 20–37. http://dx.doi.org/10.4204/eptcs.48.5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Harmer, Russ. "Rule-based Modelling and Tunable Resolution." Electronic Proceedings in Theoretical Computer Science 9 (November 15, 2009): 65–72. http://dx.doi.org/10.4204/eptcs.9.8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Zhu, Z. Y., M. S. Johnson, H. Wako, R. Sowdhamini, N. Srinivasan, K. Guruprasad, Z. Sun, et al. "Rule-based approaches to comparative modelling." Acta Crystallographica Section A Foundations of Crystallography 49, s1 (August 21, 1993): c149. http://dx.doi.org/10.1107/s0108767378095756.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bie, Zujie, Qi Han, Chao Liu, Junjian Huang, Lepeng Song, and Yangjun Pei. "Chaotic Behavior of One-Dimensional Cellular Automata Rule 24." Discrete Dynamics in Nature and Society 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/304297.

Full text

Abstract:

Wolfram divided the 256 elementary cellular automata rules informally into four classes using dynamical concepts like periodicity, stability, and chaos. Rule 24, which is Bernoulliστ-shift rule and is member of Wolfram’s class II, is said to be simple as periodic before. Therefore, it is worthwhile studying dynamical behaviors of four rules, whether they possess chaotic attractors or not. In this paper, the complex dynamical behaviors of rule 24 of one-dimensional cellular automata are investigated from the viewpoint of symbolic dynamics. We find that rule 24 is chaotic in the sense of both Li-Yorke and Devaney on its attractor. Furthermore, we prove that four rules of global equivalenceε52of cellular automata are topologically conjugate. Then, we use diagrams to explain the attractor of rule 24, where characteristic function is used to describe the fact that all points fall into Bernoulli-shift map after two iterations under rule 24.

APA, Harvard, Vancouver, ISO, and other styles

6

Ciancarini, Paolo. "An overview of declarative process modelling using logic programming." Knowledge Engineering Review 11, no. 4 (December 1996): 303–16. http://dx.doi.org/10.1017/s0269888900008006.

Full text

Abstract:

AbstractSoftware process modelling is the activity of formalising the production lifecycle of large software systems. Its aim is to formally describe a software development process, which is then effectively used and possibly enacted by an environment able to support the geographically distributed and coordinated activities involved in the process itself. I show that rule-based languages, especially logic programming languages, are an important technology for the specification, modelling, enactment and coordination of software processes. This is because most routine activities in any development process can be defined by rules. Some initial proposals aimed at simply simulating the software process by a Prolog-like program embedding some development rules. A further step toward the integration of rule-based languages in the software process has been taken using a dynamic knowledge base as project database, and a number of special primitives have been introduced to support process programs. Currently there is a trend toward more complex programming environments, called process-centred development environments. I show how some rule-based coordination language have been used to build an environment of this kind.

APA, Harvard, Vancouver, ISO, and other styles

7

CHAKRABORTY, CHANDAN, and DEBJANI CHAKRABORTY. "FUZZY LINEAR AND POLYNOMIAL REGRESSION MODELLING OF ‘IF-THEN’ FUZZY RULEBASE." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 16, no. 02 (April 2008): 219–32. http://dx.doi.org/10.1142/s0218488508005145.

Full text

Abstract:

In developing so called fuzzy expert systems, fuzzy rule bases have been considered with greater importance. In fact, a fuzzy rule base is a knowledgebase that models human cognitive factors. Fuzzy rules are linguistic ‘IF-THEN’ constructions where ‘IF’ part consists of a set of fuzzy variables and ‘THEN’ part includes a dependent fuzzy variable. In order to identify the underlying mathematical structure in the fuzzy rule base, we develop fuzzy linear and fuzzy polynomial regression techniques in this paper. And the estimation of model parameters is also shown using least-square approach. Finally, examples are illustrated to demonstrate the proposed model.

APA, Harvard, Vancouver, ISO, and other styles

8

Hämarik, Uno, and Reimo Palm. "ON RULES FOR STOPPING THE CONJUGATE GRADIENT TYPE METHODS IN ILL‐POSED PROBLEMS." Mathematical Modelling and Analysis 12, no. 1 (March 31, 2007): 61–70. http://dx.doi.org/10.3846/1392-6292.2007.12.61-70.

Full text

Abstract:

We consider stopping rules in conjugate gradient type iteration methods for solving linear ill‐posed problems with noisy data. The noise level may be known exactly or approximately or be unknown. We propose several new stopping rules, mostly for the case of unknown noise level. Numerical comparison with known rules (discrepancy principle, montone error rule, L‐curve rule, Hanke‐Raus rule) shows that the new rules are competitive.

APA, Harvard, Vancouver, ISO, and other styles

9

Kácsor, Enikő. "Modelling Bidding Behaviour on German Photovoltaic Auctions." Energies 14, no. 2 (January 19, 2021): 516. http://dx.doi.org/10.3390/en14020516.

Full text

Abstract:

In this article renewable energy support allocation through different types of auctions are assessed. The applied methodological framework is auction theory, based on the rules governing the German photovoltaic (PV) Feed-in Premium (FIP) auctions. The work focuses on bidding strategies based on an extended levelised cost of electricity (LCOE) methodology, comparing two different set of rules: uniform price and pay-as-bid. When calculating the optimal bids an iteration is developed to find the Nash-equilibrium optimal bidding strategy. When searching for the bid function, not only strictly monotone functions, but also monotone functions are considered, extending the framework typically applied in auction theory modelling. The results suggest that the PV support allocation in the German auction system would be more cost efficient using the uniform pricing rule, since many participants bid above their true valuation in the pay-as-bid auction Nash-equilibrium. Thus from a cost minimising perspective, the application of uniform pricing rule would be a better policy decision.

APA, Harvard, Vancouver, ISO, and other styles

10

Rush, Jamie. "MODELLING STATE-CONTINGENT FISCAL RULES IN THE UNITED KINGDOM." National Institute Economic Review 254 (November 2020): R41—R53. http://dx.doi.org/10.1017/nie.2020.40.

Full text

Abstract:

I assess a novel rule that was introduced in the UK in 2015. It gave the British government fiscal flexibility whenever GDP growth warranted it. This rule lasted just a year, but it had features worth exploring. I apply solution methods for models with occasionally-binding constraints to assess the demand stabilisation properties of state-contingent fiscal rules. First it is shown that fiscal flexibility can make recessions shallower. Second, it is suggested that GDP growth, rather than measures of the output gap, is a better indicator for triggering fiscal flexibility.

APA, Harvard, Vancouver, ISO, and other styles

11

Elmaleh, S. "Rule of Thumb Modelling of Biofilm Reactors." Water Science and Technology 22, no. 1-2 (January 1, 1990): 405–18. http://dx.doi.org/10.2166/wst.1990.0165.

Full text

Abstract:

Biofilm reactors are very complex systems, the modelling of which requires sophisticated kinetic relationships concerning the highest number of species in reaction and computer simulation. In fact, the process engineer needs a rule of thumb method able to predict the output variables after modification of the operational variables. Such a “simplissime” model is derived by considering a plate reactor coated with a biofilm through which the substrates are diffusion transported and eliminated with a zero order intrinsic reaction. When the liquid-biofilm resistance is neglected, conversion depends on one parameter only, the meaning of which can be displayed. Moreover, in many cases, the flow pattern influence can be neglected. This “simplissime” model was shown accurate enough in fitting various experimental data and it can even be used as a design tool.

APA, Harvard, Vancouver, ISO, and other styles

12

Ameri, Farhad, and Christian McArthur. "Semantic rule modelling for intelligent supplier discovery." International Journal of Computer Integrated Manufacturing 27, no. 6 (September 20, 2013): 570–90. http://dx.doi.org/10.1080/0951192x.2013.834467.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Chen, Qiming. "A rule-based object/task modelling approach." ACM SIGMOD Record 15, no. 2 (June 15, 1986): 281–92. http://dx.doi.org/10.1145/16856.16882.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Goedertier, Stijn, Raf Haesen, and Jan Vanthienen. "Rule-based business process modelling and enactment." International Journal of Business Process Integration and Management 3, no. 3 (2008): 194. http://dx.doi.org/10.1504/ijbpim.2008.023219.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Hamano, Masahiro. "Stochastic Transcription Elongation via Rule Based Modelling." Electronic Notes in Theoretical Computer Science 326 (October 2016): 73–88. http://dx.doi.org/10.1016/j.entcs.2016.09.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Liu, Han, Alexander Gegov, and Mihaela Cocea. "Rule Based Networks: An Efficient and Interpretable Representation of Computational Models." Journal of Artificial Intelligence and Soft Computing Research 7, no. 2 (April 1, 2017): 111–23. http://dx.doi.org/10.1515/jaiscr-2017-0008.

Full text

Abstract:

Abstract Due to the vast and rapid increase in the size of data, data mining has been an increasingly important tool for the purpose of knowledge discovery to prevent the presence of rich data but poor knowledge. In this context, machine learning can be seen as a powerful approach to achieve intelligent data mining. In practice, machine learning is also an intelligent approach for predictive modelling. Rule learning methods, a special type of machine learning methods, can be used to build a rule based system as a special type of expert systems for both knowledge discovery and predictive modelling. A rule based system may be represented through different structures. The techniques for representing rules are known as rule representation, which is significant for knowledge discovery in relation to the interpretability of the model, as well as for predictive modelling with regard to efficiency in predicting unseen instances. This paper justifies the significance of rule representation and presents several existing representation techniques. Two types of novel networked topologies for rule representation are developed against existing techniques. This paper also includes complexity analysis of the networked topologies in order to show their advantages comparing with the existing techniques in terms of model interpretability and computational efficiency.

APA, Harvard, Vancouver, ISO, and other styles

17

Han, Qi, Xiaofeng Liao, and Chuandong Li. "Complex Dynamic Behaviors in Cellular Automata Rule 14." Discrete Dynamics in Nature and Society 2012 (2012): 1–12. http://dx.doi.org/10.1155/2012/258309.

Full text

Abstract:

Wolfram divided the 256 elementary cellular automata rules informally into four classes using dynamical concepts like periodicity, stability, and chaos. Rule 14, which is Bernoulliστ-shift rule and is a member of Wolfram’s class II, is said to be simple as periodic before. Therefore, it is worthwhile studying dynamical behaviors of rule 14, whether it possesses chaotic attractors or not. In this paper, the complex dynamical behaviors of rule 14 of one-dimensional cellular automata are investigated from the viewpoint of symbolic dynamics. We find that rule 14 is chaotic in the sense of both Li-Yorke and Devaney on its attractor. Then, we prove that there exist fixed points in rule 14. Finally, we use diagrams to explain the attractor of rule 14, where characteristic function is used to describe that all points fall into Bernoulli-shift map after two iterations under rule 14.

APA, Harvard, Vancouver, ISO, and other styles

18

Rajab, Sharifa. "Rule Base Simplification and Constrained Learning for Interpretability in TSK Neuro-Fuzzy Modelling." International Journal of Fuzzy System Applications 9, no. 2 (April 2020): 31–58. http://dx.doi.org/10.4018/ijfsa.2020040102.

Full text

Abstract:

Neuro-fuzzy systems based on a fuzzy model proposed by Takagi, Sugeno and Kang known as the TSK fuzzy model provide a powerful method for modelling uncertain and highly complex non-linear systems. The initial fuzzy rule base in TSK neuro-fuzzy systems is usually obtained using data driven approaches. This process induces redundancy into the system by adding redundant fuzzy rules and fuzzy sets. This increases complexity which adversely affects generalization capability and transparency of the fuzzy model being designed. In this article, the authors explore the potential of TSK fuzzy modelling in developing comparatively interpretable neuro-fuzzy systems with better generalization capability in terms of higher approximation accuracy. The approach is based on three phases, the first phase deals with automatic data driven rule base induction followed by rule base simplification phase. Rule base simplification uses similarity analysis to remove similar fuzzy sets and resulting redundant fuzzy rules from the rule base, thereby simplifying the neuro-fuzzy model. During the third phase, the parameters of membership functions are fine-tuned using a constrained hybrid learning technique. The learning process is constrained which prevents unchecked updates to the parameters so that a highly complex rule base does not emerge at the end of model optimization phase. An empirical investigation of this methodology is done by application of this approach to two well-known non-linear benchmark forecasting problems and a real-world stock price forecasting problem. The results indicate that rule base simplification using a similarity analysis effectively removes redundancy from the system which improves interpretability. The removal of redundancy also increased the generalization capability of the system measured in terms of increased forecasting accuracy. For all the three forecasting problems the proposed neuro-fuzzy system demonstrated better accuracy-interpretability tradeoff as compared to two well-known TSK neuro-fuzzy models for function approximation.

APA, Harvard, Vancouver, ISO, and other styles

19

CHEN, LIN, FANGYUE CHEN, WEIFENG JIN, FANGFANG CHEN, and GUANRONG CHEN. "SOME NONROBUST BERNOULLI-SHIFT RULES." International Journal of Bifurcation and Chaos 19, no. 10 (October 2009): 3407–15. http://dx.doi.org/10.1142/s0218127409024840.

Full text

Abstract:

In this paper, it is shown that elementary cellular automata rule 172, as a member of the Chua's robust period-1 rules and the Wolfram class I, is also a nonrobust Bernoulli-shift rule. This rule actually exhibits complex Bernoulli-shift dynamics in the bi-infinite binary sequence space. More precisely, in this paper, it is rigorously proved that rule 172 is topologically mixing and has positive topological entropy on a subsystem. Hence, rule 172 is chaotic in the sense of both Li–Yorke and Devaney. The method developed in this paper is also applicable to checking the subshifts contained in other robust period-1 rules, for example, rules 168 and 40, which also represent nonrobust Bernoulli-shift dynamics.

APA, Harvard, Vancouver, ISO, and other styles

20

Webber, Don J., Ian Milliner, and Paul White. "A STATISTICAL DEVELOPMENT OF FIXED ODDS BETTING RULES IN SOCCER." Journal of Gambling Business and Economics 3, no. 1 (January 2, 2013): 89–99. http://dx.doi.org/10.5750/jgbe.v3i1.543.

Full text

Abstract:

Two simple but seemingly profitable betting rules for betting on the away win in association football are developed. One rule is consistent with avoiding those games in which there is a clear favourite. The second rule is based directly on modelling bookmaker odds and assessing the residuals under the fitted model. Contrary to previous research the betting rule using the residuals suggests avoiding betting on those games where there are large discrepancies between bookmaker odds and predicted-model odds.

APA, Harvard, Vancouver, ISO, and other styles

21

van Middelkoop, Manon, Aloys W. J. Borgers, and H. J. P. Timmermans. "Modelling Tourist Destination Choice Using a Decision Table Induction Algorithm." Environment and Planning A: Economy and Space 35, no. 9 (September 2003): 1669–87. http://dx.doi.org/10.1068/a35182.

Full text

Abstract:

The authors report on the development and test of a rule-based model of tourist destination choice, using decision tables to represent the rules that specify the conditions under which particular destination choices are made. Rules are extracted from empirical data on tourist destination choice, collected in the Netherlands in 1998. The specification of the model and its performance are discussed.

APA, Harvard, Vancouver, ISO, and other styles

22

Jakutis, Algirdas. "MODELLING OF ECONOMICS REGULATIONS." Technological and Economic Development of Economy 10, no. 3 (September 30, 2004): 102–8. http://dx.doi.org/10.3846/13928619.2004.9637665.

Full text

Abstract:

Economics may be presented in the form of corroborated rules. Economics may be defined as a science consisting of economic principles, laws, features, criteria, limitations, axioms, etc. Each listed entity may be divided into categories. Categories (category ‐ instruction) are theoretical concepts meaning the most important aspects of restoration of reality. Categories are forms giving theoretical meaning to practical experience. Categories give names to economic phenomena. Categories are presented and analysed in textbooks, reference books, and encyclopaedias. Categories are interconnected since the economic phenomena reflected by the categories are mutually connected. There are numerous relations among categories. These relations are like a network or a tree since one category is connected with several other categories, whereas the latter, in their own turn, are connected with the other categories. We may analyze the category “investment” as an example. The term “investments” is defined as the putting of capital into an enterprise. Capital is everything that has been created by the labour of people and it is being used for the manufacture of a final product. An enterprise is the production or commercial economic entity. Further, the following categories should be defined: labour, benefit, a product, production, commerce, and economy. Then the categories included in the above mentioned categories should be defined. A man models economic corroborated rules by means of a computer. The computer can find the main compositions to systematise the tremendous number thereof, quickly find necessary information, group corroborated rules, register and analyse them, and store information. However, the creation of a suitable program is quite a long and hard process. Corroborated rules which are regular and stable (are not variable) in real life may be simulated by a computer. A computer cannot apply the observation, verification, and genetic methods since it is only capable to analyse available information. Information changes very quickly and for this reason the results obtained are not accurate. The following distribution of work is possible: a man models separate (single) and couple compositions. The compositions consisting of three and a larger number of compounds are simulated by a computer. The identification of corroborated rules means that the types of corroborated rules taken out of the known economic text must be identified: laws, principles, features, and so on. It is quite easy to perform this work without using a computer provided that the volume of work is not large. However sometimes some doubts arise: to which type should a certain corroborated rule be attributed. Doubts are caused by the insufficiently accurate and simple definition of types of corroborated rules. While computerising the identification of economic corroborated rules it is important to accurately define the types of economic corroborated rules, then make algorithms and programs for the identification of each type of a corroborated rule. Identification enables to assess an economic text. The text the corroborated rules of which are presented in a certain order is acceptable for a reader. Consistent presentation facilitates the understanding of a text.

APA, Harvard, Vancouver, ISO, and other styles

23

Xiao, Hui, and Loo Hay Lee. "Efficient Simulation Budget Allocation for Ranking the TopmDesigns." Discrete Dynamics in Nature and Society 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/195054.

Full text

Abstract:

We consider the problem of ranking the topmdesigns out ofkalternatives. Using the optimal computing budget allocation framework, we formulate this problem as that of maximizing the probability of correctly ranking the topmdesigns subject to the constraint of a fixed limited simulation budget. We derive the convergence rate of the false ranking probability based on the large deviation theory. The asymptotically optimal allocation rule is obtained by maximizing this convergence rate function. To implement the simulation budget allocation rule, we suggest a heuristic sequential algorithm. Numerical experiments are conducted to compare the effectiveness of the proposed simulation budget allocation rule. The numerical results indicate that the proposed asymptotically optimal allocation rule performs the best comparing with other allocation rules.

APA, Harvard, Vancouver, ISO, and other styles

24

Olesiak, Krzysztof. "APPLICATION OF FUZZY LOGIC TOOLBOX FOR MODELLING FUZZY LOGIC CONTROLLERS." SOCIETY. INTEGRATION. EDUCATION. Proceedings of the International Scientific Conference 3 (May 26, 2017): 539. http://dx.doi.org/10.17770/sie2017vol3.2398.

Full text

Abstract:

Computer technology, which has been developing very fast in the recent years, can be also fruitfully applied in teaching. For example, the software package Matlab is highly useful in teaching students at Bachelor Programs of Electrical Engineering and Automatics and Robotics. Fuzzy Logic Toolbox of the Matlab package can be used for designing and modelling controllers. Thanks to a large number of pre-defined elements available in the libraries, it is possible to create even highly complicated models of systems without much effort. Fuzzy Logic Toolbox is especially useful for exploring the basic rules of designing fuzzy logic controllers. The rules involve selecting input and output membership functions, determining their location with respect to one another and defining their ranges. When the membership functions are introduced, a rule base is defined and a defuzzification method is selected. For any defuzzification method, a control surface is obtained, which can be modified by changing the rule base and/or the input and output parameters of the membership function.

APA, Harvard, Vancouver, ISO, and other styles

25

Ghosh, Soma, K. V. S. Prasad, Saraswathi Vishveshwara, and Nagasuma Chandra. "Rule-based modelling of iron homeostasis in tuberculosis." Molecular BioSystems 7, no. 10 (2011): 2750. http://dx.doi.org/10.1039/c1mb05093a.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Vuong, G. T., and G. Paris. "Rule-based relay modelling for transient-stability studies." IEEE Transactions on Power Systems 3, no. 3 (August 1988): 1306–9. http://dx.doi.org/10.1109/59.14596.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Xiong, N. "Evolutionary learning of rule premises for fuzzy modelling." International Journal of Systems Science 32, no. 9 (January 2001): 1109–18. http://dx.doi.org/10.1080/00207720010015735.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Pedersen, Michael, Andrew Phillips, and Gordon D. Plotkin. "A High-Level Language for Rule-Based Modelling." PLOS ONE 10, no. 6 (June 4, 2015): e0114296. http://dx.doi.org/10.1371/journal.pone.0114296.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Krone, Angelika, and Heike Taeger. "Data-based fuzzy rule test for fuzzy modelling." Fuzzy Sets and Systems 123, no. 3 (November 2001): 343–58. http://dx.doi.org/10.1016/s0165-0114(00)00112-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Kaiser, G. E. "Rule-based modelling of the software development process." ACM SIGSOFT Software Engineering Notes 14, no. 4 (May 1989): 84–86. http://dx.doi.org/10.1145/75111.75123.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Wang, A. P., and H. Wang. "Minimum Structured Processes Modelling: A Rule-Based Approach." International Journal of Modelling and Simulation 15, no. 3 (January 1995): 113–19. http://dx.doi.org/10.1080/02286203.1995.11760261.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Hamano, Masahiro. "Sustainability of RNA-interference in Rule Based Modelling." Electronic Notes in Theoretical Computer Science 313 (May 2015): 65–77. http://dx.doi.org/10.1016/j.entcs.2015.04.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

CHUA, LEON O., and GIOVANNI E. PAZIENZA. "A NONLINEAR DYNAMICS PERSPECTIVE OF WOLFRAM'S NEW KIND OF SCIENCE. PART XIII: BERNOULLI στ-SHIFT RULES." International Journal of Bifurcation and Chaos 20, no. 07 (July 2010): 1859–2003. http://dx.doi.org/10.1142/s0218127410026903.

Full text

Abstract:

More than one third of the 88 globally-independent Cellular Automata rules exhibit robust simple Bernoulli-shift dynamics. Among them we find rule [Formula: see text], which we proved to be chaotic in the previous episodes of our chronicle, and rule [Formula: see text], the famous global majority rule. Therefore, we cannot overstate the importance of the Bernoulli στ-shift rules which we will present in two parts of our continuing odyssey on the Nonlinear Dynamics Perspective of Cellular Automata. This paper covers the first 15 of the 30 Bernoulli στ-shift rules. In this paper, after recalling the main concepts of Bernoulli rules — such as the role of the three Bernoulli parameters σ, τ and β — we will display the basin tree diagrams of these rules together with a convenient summary of the results extracted from them. Then, we will show that the superstring [Formula: see text] is an excellent testing signal to find the robust behavior of a given rule. Finally, we will conclude this paper with a discussion about the difference between robust and nonrobust ω-limit orbits of the Bernoulli στ-shift rules.

APA, Harvard, Vancouver, ISO, and other styles

34

Abid, Adeel, and Yusra Khalid. "Rule of Prescription Under Article III, Rule 6 of Hague/Hague-Visby Rules: When Does the Clock of Limitation Start Ticking?" Open Transportation Journal 14, no. 1 (April 22, 2020): 38–43. http://dx.doi.org/10.2174/1874447802014010038.

Full text

Abstract:

The pursuit of an internationally recognized regime which governs the allocation of risk of liability has been the predominant purpose of maritime law. At the same time, it is also necessary to set a time limit within which a legal action may be brought against the carrier. There are two regimes which govern the carriage of goods by sea and are adopted by many countries, the Hague Rules, and the Hague-Visby Rules and the time limit for claims set out in the rules against the carrier is one year from the day on which the goods are delivered or should have been delivered by the carrier. The rationale behind this is that the carrier cannot be expected to keep records for long periods and must be notified while the events are still fairly recent and recorded, as to what claims are to be presented. At present, Pakistan has adopted the Hague Rules in its Carriage of Goods by Sea Act, 1925 and despite the clarity embodied in the period of limitation as laid down under Article III, Rule 6, Pakistani Courts have given various interpretations to the term “delivery”, resulting in different outcome of the cases. In relation thereof, this article examines and discusses several judgments for decades on the subject of rule of prescription, along with the analysis of Article III, Rule 2 on the interpretation of “discharge”, and puts forward some suggestions and recommendations on the law laid down by the Convention. The rules for transport documents are based on Hague or Hague-Visby Rules, and therefore, it is necessary at the outset of the article to provide an overview of the transport system in the country. The need for efficient working of the transport system in the country is absolutely vital in view of its role in a country’s economic growth.

APA, Harvard, Vancouver, ISO, and other styles

35

Palmer, Andrew. "Centrifuge modelling of ice and brittle materials." Canadian Geotechnical Journal 28, no. 6 (December 1, 1991): 896–98. http://dx.doi.org/10.1139/t91-105.

Full text

Abstract:

Centrifuge modelling of a system that deforms by repeated fracture is analysed. If the governing crack length during repeated fracture is a material property, classical centrifuge modelling continues to apply. If, on the other hand, the cracks and ice fragments scale with the system as a whole, a different scaling rule follows: the acceleration imposed in the centrifuge should be the 3/2 power of the linear scale factor. Though at first sight surprising, this rule is consistent with field observations. Key words: ice, centrifuge modelling, fracture.

APA, Harvard, Vancouver, ISO, and other styles

36

Mengall, G. "Fuzzy modelling for aircraft dynamics identification." Aeronautical Journal 105, no. 1051 (September 2001): 551–55. http://dx.doi.org/10.1017/s0001924000018029.

Full text

Abstract:

A new methodology is described to identify aircraft dynamics and extract the corresponding aerodynamic coefficients. The proposed approach makes use of fuzzy modelling for the identification process where input/output data are first classified by means of the concept of fuzzy clustering and then the linguistic rules are extracted from the fuzzy clusters. The fuzzy rule-based models are in the form of affine Takagi-Sugeno models, that are able to approximate a large class of nonlinear systems. A comparative study is performed with existing techniques based on the employment of neural networks, showing interesting advantages of the proposed methodology both for the physical insight of the identified model and the simplicity to obtain accurate results with fewer parameters to be properly tuned.

APA, Harvard, Vancouver, ISO, and other styles

37

Bishop, I. D., and H. R. Gimblett. "Management of Recreational Areas: GIS, Autonomous Agents, and Virtual Reality." Environment and Planning B: Planning and Design 27, no. 3 (June 2000): 423–35. http://dx.doi.org/10.1068/b2637.

Full text

Abstract:

Management of recreational activity in areas that are culturally or ecologically sensitive requires knowledge, and effective management, of recreationists' behaviour. In this paper we explore the role of spatial information systems, spatial modelling, and virtual reality in the analysis and prediction of visitor location and movement patterns. The quantitative modelling of the time spent by visitors on various aspects of the site attractions and of visitor conflict has not been widely attempted, having only recently become possible because of greater computer power, better spatial data storage options, and new modelling paradigms. Rule-driven autonomous agents can be used as surrogates for human visitors. Behavioural rules can be derived and calibrated from visitor surveys. This is, however, an expensive and time-consuming process and testing of people's decisions in a virtual environment may provide sufficient information for rule definition. Once a rule-set is determined, the autonomous agents move over a GIS-based model of the landscape. Rendering algorithms determine what an individual agent is able to “see”. Based on the established rules, this and other factors (such as tiredness) determine behavioural choice. Recording of model runs to file allows managers to undertake additional analysis to quantify and explore the influence of alternative management options on recreationist movement, congestion, and crowding. Through the GIS, impacts such as erosion can also be modelled. In the longer term the combined models can become part of a decision support system for sustainable tourism in fragile environments.

APA, Harvard, Vancouver, ISO, and other styles

38

Pizzileo, B., K. Li, and G. W. Irwin. "A New Rule Selection Procedure for Fuzzy-Neural Modelling." IFAC Proceedings Volumes 42, no. 10 (2009): 1499–504. http://dx.doi.org/10.3182/20090706-3-fr-2004.00250.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Hatzinikolaou, Dimitris. "Modelling consumption: permanent-income or rule-of-thumb behaviour?" Economic Modelling 16, no. 2 (April 1999): 293–306. http://dx.doi.org/10.1016/s0264-9993(98)00044-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

F. Oladejo, Bolanle. "Modelling of an Extended Brutedl Algorithm for Rule Extraction." American Journal of Applied Mathematics 4, no. 6 (2016): 330. http://dx.doi.org/10.11648/j.ajam.20160406.20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Gregory, R., J. R. Saunders, and V. A. Saunders. "Rule-based modelling of conjugative plasmid transfer and incompatibility." Biosystems 91, no. 1 (January 2008): 201–15. http://dx.doi.org/10.1016/j.biosystems.2007.09.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Salah, Khaled, and Aslam Chaudary. "Modelling and analysis of rule-based network security middleboxes." IET Information Security 9, no. 6 (November 1, 2015): 305–12. http://dx.doi.org/10.1049/iet-ifs.2014.0545.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Lam, Vitus S. W. "Detecting violation of business constraints in declarative process execution: a case study." Business Process Management Journal 23, no. 5 (September 4, 2017): 1043–63. http://dx.doi.org/10.1108/bpmj-05-2016-0105.

Full text

Abstract:

Purpose Declarative process modelling is a constraint-centric approach that treats business rules as first-class citizens in business process models. Augmenting the declarative process modelling technique with capability to detect the constraint violations during business process execution is of crucial importance. The purpose of this paper is to contribute to the modelling of business rules through a repository of pattern-oriented templates. Design/methodology/approach The semantics of the business rule templates is underpinned by linear temporal logic (LTL). Automated temporal reasoning is then conducted for determining whether process executions adhere to the business rules through the utilisation of the Logics Workbench (LWB). An application of the methodological framework is illustrated by a realistic case study on degree requirements verification. Findings To access the practicality of the approach, the case study of this paper is based on the verification of degree requirements, which is different from the domain area of the case study in the author’s prior work. The findings indicated that the temporal framework could be applied to the declarative process modelling in a consistent and efficient manner. Originality/value This paper is an extended version of the author’s earlier study. More details on the LTL and LWB are provided in the current study. The author introduces 17 new business rule templates and illustrates the utilisation of the new templates via a case study that belongs to a different domain area.

APA, Harvard, Vancouver, ISO, and other styles

44

Khan, Muhammad Taimoor, Shehzad Khalid, and Furqan Aziz. "Graph clustering based size varying rules for lifelong topic modelling." Global Journal of Computer Sciences: Theory and Research 8, no. 3 (December 29, 2018): 111–19. http://dx.doi.org/10.18844/gjcs.v8i3.4021.

Full text

Abstract:

Lifelong learning topic models identify the hidden concepts discussed in the collection of documents. Lifelong learning models have an automatic learning mechanism. In the learning process, the model gets more knowledgeable with experience as it learns from the past in the form of rules. It carries rules to the future and utilises them when a similar scenario arise in the future. The existing lifelong learning topic models heavily rely on statistical measures to learn rules that lead to two limitations. In this research work, we introduce complex networks analysis for learning rules. The rules are obtained through hierarchical clustering of the complex network that has different number of words within a rule and has directed orientation. The proposed approach improves the utilisation of rules for improved quality of topics at higher performance with unidirectional rules on the standard lifelong learning dataset. Keywords: networks, lifelong, models, networks analysis

APA, Harvard, Vancouver, ISO, and other styles

45

Kou, Zhicong. "Association rule mining using chaotic gravitational search algorithm for discovering relations between manufacturing system capabilities and product features." Concurrent Engineering 27, no. 3 (May 10, 2019): 213–32. http://dx.doi.org/10.1177/1063293x19832949.

Full text

Abstract:

An effective data mining method to automatically extract association rules between manufacturing capabilities and product features from the available historical data is essential for efficient and cost-effective product development and production. This article proposes a chaotic gravitational search algorithm–based association rule mining method for discovering the hidden relationship between manufacturing system capabilities and product features. The extracted rules would be utilized to predict capability requirements of various machines for the new product with different features. We use two strategies to incorporate chaos into gravitational search algorithm: one strategy is to embed chaotic map functions into the gravitational constant of gravitational search algorithm; the other is to use sequences generated by chaotic maps to substitute random numbers for different parameters of gravitational search algorithm. In order to improve the applicability of chaotic gravitational search algorithm–based association rule mining, a novel overlapping measure indication is further proposed to eliminate those unuseful rules. The proposed method is relatively simple and easy to implement. The rules generated by chaotic gravitational search algorithm–based association rule mining are accurate, interesting, and comprehensible to the user. The performance comparison indicates that chaotic gravitational search algorithm–based association rule mining outperforms other regular methods (e.g. Apriori) for association rule mining. The experimental results illustrate that chaotic gravitational search algorithm–based association rule mining is capable of discovering important association rules between manufacturing system capabilities and product features. This will help support planners and engineers for the new product design and manufacturing.

APA, Harvard, Vancouver, ISO, and other styles

46

CHUA, LEON O., VALERY I. SBITNEV, and SOOK YOON. "A NONLINEAR DYNAMICS PERSPECTIVE OF WOLFRAM'S NEW KIND OF SCIENCE PART VI: FROM TIME-REVERSIBLE ATTRACTORS TO THE ARROW OF TIME." International Journal of Bifurcation and Chaos 16, no. 05 (May 2006): 1097–373. http://dx.doi.org/10.1142/s0218127406015544.

Full text

Abstract:

This paper proves, via an analytical approach, that 170 (out of 256) Boolean CA rules in a one-dimensional cellular automata (CA) are time-reversible in a generalized sense. The dynamics on each attractor of a time-reversible rule N is exactly mirrored, in both space and time, by its bilateral twin ruleN†. In particular, all 69 period-1 rules, 17 (out of 25) period-2 rules, and 84 (out of 112) Bernoulli rules are time-reversible. The remaining 86 CA rules are time-irreversible in the sense that N and N† mirror their dynamics only in space, but not in time. In this case, each attractor of N defines a unique arrow of time. A simple "time-reversal test" is given for testing whether an attractor of a CA rule is time-reversible or time-irreversible. For a time-reversible attractor of a CA rule N the past can be uniquely recovered from the future of N†, and vice versa. This remarkable property provides 170 concrete examples of CA time machines where time travel can be routinely achieved by merely hopping from one attractor to its bilateral twin attractor, and vice versa. Moreover, the time-reversal property of some local rules can be programmed to mimic the matter–antimatter "annihilation" or "pair-production" phenomenon from high-energy physics, as well as to mimic the "contraction" or "expansion" scenarios associated with the Big Bang from cosmology. Unlike the conventional laws of physics, which are based on a unique universe, most CA rules have multiple universes (i.e. attractors), each blessed with its own laws. Moreover, some CA rules are endowed with both time-reversible attractors and time-irreversible attractors. Using an analytical approach, the time-τ return map of each Bernoulli στ-shift attractor of all 112 Bernoulli rules are shown to obey an ultra-compact formula in closed form, namely,. [Formula: see text] or its inverse map. These maps completely characterize the time-asymptotic (steady state) behavior of the nonlinear dynamics on the attractors. In-depth analysis of all but 18 global equivalence classes of CA rules have been derived, along with their basins of attraction, which characterize their transient regimes. Above all, this paper provides a rigorous nonlinear dynamics foundation for a paradigm shift from an empirical-based approach à la Wolfram to an attractor-based analytical theory of cellular automata.

APA, Harvard, Vancouver, ISO, and other styles

47

Lam, Vitus. "Constraint-based reasoning on declarative process execution with the logics workbench." Business Process Management Journal 21, no. 3 (June 1, 2015): 586–609. http://dx.doi.org/10.1108/bpmj-10-2014-0092.

Full text

Abstract:

Purpose – An integral part of declarative process modelling is to guarantee that the execution of a declarative workflow is compliant with the respective business rules. The purpose of this paper is to establish a formal framework for representing business rules and determining whether any business rules are violated during the executions of declarative process models. Design/methodology/approach – In the approach, a business rule is phrased in terms of restricted English that is related to a constraint template. Linear temporal logic (LTL) is employed as a formalism for defining the set of constraint templates. By exploiting the theorem-proving feature of the Logics Workbench (LWB), business rule violations are then detected in an automatic manner. Findings – This study explored the viability of encoding: first, process executions by means of LTL and second, business rules in terms of restricted English that built upon pattern-oriented templates and LTL. The LWB was used for carrying out temporal reasoning through automated techniques. The applicability of the formal verification approach was exemplified by a case study concerning supply chain management. The findings showed that practical reasoning could be achieved by combining declarative process modelling, restricted English, pattern-oriented templates, LTL and LWB. Originality/value – First, new business rule templates are proposed; second, business rules are expressed in restricted English instead of graphical constructs; third, both finite execution trace and business rules are grounded in LTL. There is no need to deal with the semantic differences between different formalisms; and finally, the theorem prover LWB is used for the conformance checking of a finite execution trace against business rules.

APA, Harvard, Vancouver, ISO, and other styles

48

ALCALÁ, R., M. J. GACTO, F. HERRERA, and J. ALCALÁ-FDEZ. "A MULTI-OBJECTIVE GENETIC ALGORITHM FOR TUNING AND RULE SELECTION TO OBTAIN ACCURATE AND COMPACT LINGUISTIC FUZZY RULE-BASED SYSTEMS." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 15, no. 05 (October 2007): 539–57. http://dx.doi.org/10.1142/s0218488507004868.

Full text

Abstract:

This work proposes the application of Multi-Objective Genetic Algorithms to obtain Fuzzy Rule-Based Systems with a better trade-off between interpretability and accuracy in linguistic fuzzy modelling problems. To do that, we present a new post-processing method that by considering selection of rules together with tuning of membership functions gets solutions only in the Pareto zone with the highest accuracy, i.e., containing solutions with the least number of possible rules but still presenting high accuracy. This method is based on the well-known SPEA2 algorithm, applying appropriate genetic operators and including some modifications to concentrate the search in the desired Pareto zone.

APA, Harvard, Vancouver, ISO, and other styles

49

KEANE, AIDAN, JULIA P. G. JONES, and E. J. MILNER-GULLAND. "Modelling the effect of individual strategic behaviour on community-level outcomes of conservation interventions." Environmental Conservation 39, no. 4 (May 18, 2012): 305–15. http://dx.doi.org/10.1017/s0376892912000124.

Full text

Abstract:

SUMMARYMany conservation interventions seek to change resource users' behaviour through the creation and enforcement of rules. Their success depends on changing the incentives of potential rule-breakers and those who monitor and enforce compliance. Project implementers may use payments to encourage monitoring and sanctions to deter rule breaking but there has been little research to examine the effectiveness of such approaches in promoting compliance with conservation rules. The effects of payments and sanctions on poaching in a hypothetical community-based conservation project were investigated using an individual-based model incorporating individual heterogeneity and a realistic range of behaviours. Individuals could choose to poach, monitor others' behaviour, or ‘cheat’ (claim a fee without actually monitoring behaviour). They could also invest in avoidance to reduce their probability of being detected breaking rules. Community-level outcomes emerged from individuals’ choices and strategic interactions. The model demonstrates that payments and sanctions can interact strongly with one another and that their effects depend on the economic context in which they are applied. Sanctions were more reliable than payments in reducing poaching and, in some circumstances, payments produced perverse effects. It is thus important to consider individual-level heterogeneity and strategic decision-making when designing interventions aimed at changing human behaviour.

APA, Harvard, Vancouver, ISO, and other styles

50

Aljassas, Safaa M., Dhuha Abdulameer Kadhim, and Eman Yahea Habeeb. "Two Numerical Methods (RO (MSuM) and RO (SuMSu)) for Triple Integrals with for Continuous Functions." Mathematical Modelling of Engineering Problems 8, no. 4 (August 31, 2021): 635–44. http://dx.doi.org/10.18280/mmep.080417.

Full text

Abstract:

The main goal of this research is to calculate a triple integral included continuous integrands numerically by two composite rules. The first rule is the Mid-point method on the third dimension Z and the first dimension X with a suggested method on the second dimension Y, that is denoted by MSuM. The second rule is the suggested method on the third dimension Z and the first dimension X with a Mid-point method on the second dimension Y, that is denoted by SuMSu. The number of partial intervals is equals on the three dimensions. The study represented two theorems with the proofs to get such rules and the correction terms (the error terms) for each of rule. Moreover, to accelerate convergence and get better results, Romberg acceleration is used with both rules. These rules recalled by RO(MSuM) and RO(SuMSu) respectively such that the obtained results were high accuracy by relatively few partial intervals and shorter times.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!