Decision Trees for Applicability of Evolution Rules in Transition P Systems

Transition P Systems are a parallel and distributed computational model based on the notion of the cellular membrane structure. Each membrane determines a region that encloses a multiset of objects and evolution rules. Transition P Systems evolve through transitions between two consecutive configurations that are determined by the membrane structure and multisets present inside membranes. Moreover, transitions between two consecutive configurations are provided by an exhaustive non-deterministic and parallel application of active evolution rules subset inside each membrane of the P system. But, to establish the active evolution rules subset, it is required the previous calculation of useful and applicable rules. Hence, computation of applicable evolution rules subset is critical for the whole evolution process efficiency, because it is performed in parallel inside each membrane in every evolution step. The work presented here shows advantages of incorporating decision trees in the evolution rules applicability algorithm. In order to it, necessary formalizations will be presented to consider this as a classification problem, the method to obtain the necessary decision tree automatically generated and the new algorithm for applicability based on it.

HW Implementation of a Optimized Algorithm for the Application of Active Rules in a Transition P-system

P systems or Membrane Computing are a type of a distributed, massively parallel and non deterministic system based on biological membranes. They are inspired in the way cells process chemical compounds, energy and information. These systems perform a computation through transition between two consecutive configurations. As it is well known in membrane computing, a configuration consists in a m-tuple of multisets present at any moment in the existing m regions of the system at that moment time. Transitions between two configurations are performed by using evolution rules which are in each region of the system in a non-deterministic maximally parallel manner. This work is part of an exhaustive investigation line. The final objective is to implement a HW system that evolves as it makes a transition P-system. To achieve this objective, it has been carried out a division of this generic system in several stages, each of them with concrete matters. In this paper the stage is developed by obtaining the part of the system that is in charge of the application of the active rules. To count the number of times that the active rules is applied exist different algorithms. Here, it is presents an algorithm with improved aspects: the number of necessary iterations to reach the final values is smaller than the case of applying step to step each rule. Hence, the whole process requires a minor number of steps and, therefore, the end of the process will be reached in a shorter length of time.

Optimal Decision Rules in Logical Recognition Models

The task of smooth and stable decision rules construction in logical recognition models is considered. Logical regularities of classes are defined as conjunctions of one-place predicates that determine the membership of features values in an intervals of the real axis. The conjunctions are true on a special no extending subsets of reference objects of some class and are optimal. The standard approach of linear decision rules construction for given sets of logical regularities consists in realization of voting schemes. The weighting coefficients of voting procedures are done as heuristic ones or are as solutions of complex optimization task. The modifications of linear decision rules are proposed that are based on the search of maximal estimations of standard objects for their classes and use approximations of logical regularities by smooth sigmoid functions.

What Does a Domain Analysis Look Like in Form, Function, and Genre?

This article presents an inventory what theorists describe as the definition of domain analysis. Survey writings on and of domain analyses for their distinct attributes and arguments. Compile these components and attributes, linking them to their function, and from there. Describe a proposed ideal form of domain analysis. Evidence that while the debate about the substance and form of the epistemic and ontological character of domain analysis will continue, some might find it useful to give shape to their ideas using a particular form that follows function. If our purpose is to delineate and communicate what it is that we are analyzing when we engage in domain analysis, then I hope this small contribution can be of use.

Transformation rules form OntoProcED to OntoOKI

This file contains the transformtion rules in SWRL to translate formal specifications of two lower ontology levels (patterns and organization) to the upper level (implementation according to the OKI specification).

A Classification of Sandhi Rules for Suffix Separation in Malayalam

Suffix separation plays a vital role in improving the quality of training in the Statistical Machine Translation from English into Malayalam. The morphological richness and the agglutinative nature of Malayalam make it necessary to retrieve the root word from its inflected form in the training process. The suffix separation process accomplishes this task by scrutinizing the Malayalam words and by applying sandhi rules. In this paper, various handcrafted rules designed for the suffix separation process in the English Malayalam SMT are presented. A classification of these rules is done based on the Malayalam syllable preceding the suffix in the inflected form of the word (check_letter). The suffixes beginning with the vowel sounds like ആല, ഉെെ, ഇല etc are mainly considered in this process. By examining the check_letter in a word, the suffix separation rules can be directly applied to extract the root words. The quick look up table provided in this paper can be used as a guideline in implementing suffix separation in Malayalam language

Connectionist-based rules describing the pass-through of individual goods prices into trend inflation in the United States

This paper demonstrates a mechanism whereby rules can be extracted from a feedforward neural network trained to characterize the inflation "pass-through" problem in American monetary policy, defined as the relationship between changes in the growth rate(s) of individual commodities and the economy-wide rate of growth of consumer prices. Monthly price data are encoded and used to train a group of candidate connectionist architectures. One candidate is selected for rule extraction, using a custom decompositional extraction algorithm that generates rules in human-readable and machine-executable form. Rule and network accuracy are compared, and comments are made on the relationships expressed within the discovered rules. The types of discovered relationships could be used to guide monetary policy decisions.

Derivation and consistency checking of models in early software product line engineering

Dissertação para obtenção do Grau de Doutor em Engenharia Informática

Efficient paraconsistent reasoning with rules and ontologies for the semantic web

Ontologies formalized by means of Description Logics (DLs) and rules in the form of Logic Programs (LPs) are two prominent formalisms in the field of Knowledge Representation and Reasoning. While DLs adhere to the OpenWorld Assumption and are suited for taxonomic reasoning, LPs implement reasoning under the Closed World Assumption, so that default knowledge can be expressed. However, for many applications it is useful to have a means that allows reasoning over an open domain and expressing rules with exceptions at the same time. Hybrid MKNF knowledge bases make such a means available by formalizing DLs and LPs in a common logic, the Logic of Minimal Knowledge and Negation as Failure (MKNF). Since rules and ontologies are used in open environments such as the Semantic Web, inconsistencies cannot always be avoided. This poses a problem due to the Principle of Explosion, which holds in classical logics. Paraconsistent Logics offer a solution to this issue by assigning meaningful models even to contradictory sets of formulas. Consequently, paraconsistent semantics for DLs and LPs have been investigated intensively. Our goal is to apply the paraconsistent approach to the combination of DLs and LPs in hybrid MKNF knowledge bases. In this thesis, a new six-valued semantics for hybrid MKNF knowledge bases is introduced, extending the three-valued approach by Knorr et al., which is based on the wellfounded semantics for logic programs. Additionally, a procedural way of computing paraconsistent well-founded models for hybrid MKNF knowledge bases by means of an alternating fixpoint construction is presented and it is proven that the algorithm is sound and complete w.r.t. the model-theoretic characterization of the semantics. Moreover, it is shown that the new semantics is faithful w.r.t. well-studied paraconsistent semantics for DLs and LPs, respectively, and maintains the efficiency of the approach it extends.

Scoring rules on dichotomous preferences

In this paper, we study individual incentives to report preferences truthfully for the special case when individuals have dichotomous preferences on the set of alternatives and preferences are aggregated in form of scoring rules. In particular, we show that (a) the Borda Count coincides with Approval Voting on the dichotomous preference domain, (b) the Borda Count is the only strategy-proof scoring rule on the dichotomous preference domain, and (c) if at least three individuals participate in the election, then the dichotomous preference domain is the unique maximal rich domain under which the Borda Count is strategy-proof.

Development and Validation of Decision Rules to Guide Frequency of Monitoring CD4 Cell Count in HIV-1 Infection before Starting Antiretroviral Therapy.

Background: Although CD4 cell count monitoring is used to decide when to start antiretroviral therapy in patients with HIV-1 infection, there are no evidence-based recommendations regarding its optimal frequency. It is common practice to monitor every 3 to 6 months, often coupled with viral load monitoring. We developed rules to guide frequency of CD4 cell count monitoring in HIV infection before starting antiretroviral therapy, which we validated retrospectively in patients from the Swiss HIV Cohort Study.Methodology/Principal Findings: We built up two prediction rules ("Snap-shot rule" for a single sample and "Track-shot rule" for multiple determinations) based on a systematic review of published longitudinal analyses of CD4 cell count trajectories. We applied the rules in 2608 untreated patients to classify their 18 061 CD4 counts as either justifiable or superfluous, according to their prior >= 5% or < 5% chance of meeting predetermined thresholds for starting treatment. The percentage of measurements that both rules falsely deemed superfluous never exceeded 5%. Superfluous CD4 determinations represented 4%, 11%, and 39% of all actual determinations for treatment thresholds of 500, 350, and 200x10(6)/L, respectively. The Track-shot rule was only marginally superior to the Snap-shot rule. Both rules lose usefulness for CD4 counts coming near to treatment threshold.Conclusions/Significance: Frequent CD4 count monitoring of patients with CD4 counts well above the threshold for initiating therapy is unlikely to identify patients who require therapy. It appears sufficient to measure CD4 cell count 1 year after a count > 650 for a threshold of 200, > 900 for 350, or > 1150 for 500x10(6)/L, respectively. When CD4 counts fall below these limits, increased monitoring frequency becomes advisable. These rules offer guidance for efficient CD4 monitoring, particularly in resource-limited settings.

Setting the rules of the game: The choice of electoral systems in advanced democracies

The origins of electoral systems have received scant attention in the literature. Looking at the history of electoral rules in the advanced world in the last century, this paper shows that the existing wide variation in electoral rules across nations can be traced to the strategic decisions that the current ruling parties, anticipating the coordinating consequences of different electoral regimes, make to maximize their representation according to the following conditions. On the one hand, as long as the electoral arena does not change substantially and the current electoral regime serves the ruling parties well, the latter have no incentives to modify the electoral regime. On the other hand, as soon as the electoral arena changes (due to the entry of new voters or a change in their preferences), the ruling parties will entertain changing the electoral system, depending on two main conditions: the emergence of new parties and the coordinating capacities of the old ruling parties. Accordingly, if the new parties are strong, the old parties shift from plurality/majority rules to proportional representation (PR) only if the latter are locked into a 'non-Duvergerian' equilibrium; i.e. if no old party enjoys a dominant position (the case of most small European states)--conversely, they do not if a Duvergerian equilibrium exists (the case of Great Britain). Similarly, whenever the new entrants are weak, a non-PR system is maintained, regardless of the structure of the old party system (the case of the USA). The paper discusses as well the role of trade and ethnic and religious heterogeneity in the adoption of PR rules.

On the origins of electoral systems and political parties. The role of elections in multi-member districts

The old, understudied electoral system composed of multi-member districts, open ballot and plurality rule is presented as the most remote scene of the origin of both political parties and new electoral systems. A survey of the uses of this set of electoral rules in different parts of the world during remote and recent periods shows its wide spread. A model of voting by this electoral system demonstrates that, while it can produce varied and pluralistic representation, it also provides incentives to form factional or partisan candidacies. Famous negative reactions to the emergence of factions and political parties during the 18th and 19th centuries are reinterpreted in this context. Many electoral rules and procedures invented since the second half of the 19th century, including the Australian ballot, single-member districts, limited and cumulative ballots, and proportional representation rules, derived from the search to reduce the effects of the originating multi-member district system in favor of a single party sweep. The general relations between political parties and electoral systems are restated to account for the foundational stage here discussed.

Sum rules and correlations in asymmetric nuclear matter

The neutron and proton single-particle spectral functions in asymmetric nuclear matter fulfill energy-weighted sum rules. The validity of these sum rules within the self-consistent Green's function approach is investigated. The various contributions to these sum rules and their convergence as a function of energy provide information about correlations induced by the realistic interaction between the nucleons. The study of the sum rules in asymmetric nuclear matter exhibits the isospin dependence of the nucleon-nucleon correlations.

Rotation-electronic interaction in the 3p-complex Rydberg state of water

An energy theory is formulated for the rotational energy levels in a p-complex Rydberg state of an asymmetric top molecule of symmetry C2v. The effective Hamiltonian used consists of the usual rigid rotor Hamiltonian augmented with terms representing electronic spin and orbital angular momentum effects. Criteria for assigning symmetry species to the rotational energy levels, following Houganfs scheme that uses the full molecular group,are established and given in the form of a table. This is particularly suitable when eigenvectors are calculated on a digital computer. Also, an intensity theory for transitions to the Rydberg p-complex singlet states is presented and selection rules in terms of symmetry species of energy states are established. Finally, applications to HpO and DpO are given.