Juan M. Ale, Mauricio M. Espil · IGI Global eBooks · 2011
This chapter surveys the topic of active rules and active databases. We analyze the state of the art of active databases and active rules, their properties and applications. In particular, we describe the case of triggers following the SQL-1999 Standard Committee point of view. Then, we consider the case of dynamic constraints for which we use a temporal logic formalism. Finally, we discuss the applicability, limitations and partial solutions found when attempting to ensure the satisfaction of dynamic constraints.Request access from your librarian to read this chapter's full text.
Cited by 0
John V. Harrison, Suzanne W. Dietrich · Workshops in computing · 1994
Cited by 20
Thomas Thalhammer, Michael Schrefl, Mukesh Mohania · 2001
Conventional data warehouses are passive. All tasks related to analysing data and making decisions must be carried out manually by analysts. Even for decision tasks that occur frequently and for which well established decision procedures are available, today's data warehouse and OLAP systems do not offer the functionality to carry out such analyses without any user interaction. To cover this problem we propose an extension of the conventional data warehouse architecture with analysis rules, which mimic the work of an analyst during decision making. Analysis rules extend the basic ECA (event/condition/action) rule structure with mechanisms to analyse data multidimensionally and to make decisions. The resulting architecture is called active data warehouse. This paper (1) motivates the need for active data warehouses, (2) discusses various issues of analysis rules and provides a textual language for their specification, and (3) shows how analysis rules can be implemented on top of existing relational data warehouses. 1
Cited by 0
Boetje, Josien · Figshare · 2023
Figures displaying the active learning aided screening process and stopping rules.
Cited by 0Open access
Sergio Flesca, Sergio Greco · ArXiv.org · 2003
In this paper we analyze declarative deterministic and non-deterministic semantics for active rules. In particular we consider several (partial) stable model semantics, previously defined for deductive rules, such as well-founded, max deterministic, unique total stable model, total stable model, and maximal stable model semantics. The semantics of an active program AP is given by first rewriting it into a deductive program P, then computing a model M defining the declarative semantics of P and, finally, applying `consistent' updates contained in M to the source database. The framework we propose permits a natural integration of deductive and active rules and can also be applied to queries with function symbols or to queries over infinite databases.
Cited by 0Open access
Boetje, Josien · Figshare · 2023
Figures displaying the active learning aided screening process and stopping rules.
Cited by 0Open access
Thomas Thalhammer, Michael Schrefl, Mukesh Mohania · 2001
Conventional data warehouses are passive. All tasks related to analysing data and making decisions must be carried out manually by analysts. Today's data warehouse and OLAP systems offer little support to automatize decision tasks that occur frequently and for which well established decision procedures are available.
Cited by 0
Burcin Bostan-Korpeoglu, Adnan Yazıcı · International Journal of Uncertainty Fuzziness and Knowledge-Based Systems · 2008
Knowledge intensive applications require an intelligent environment, which can perform deductions in response to user queries or events that occur inside or outside of the applications. For that, we propose a fuzzy active object-oriented database for modeling knowledge intensive applications. In that, we incorporate fuzziness within the event, condition and action parts of an active rule. We consider deductive rules as special cases of active rules so that deductive queries are handled using abstract kind of events. We also introduce a model for fuzzy inferencing of fuzzy active rules where we develop a model for scenario concept. We use a Fuzzy Petri Net model for fuzzy rule-based inference.
Cited by 0
John V. Harrison · 1993
database systems react to pre-defined situations automatically without user intervention.
Cited by 5Open access
Research Explorer (The University of Manchester) · 1999
Cited by 0
Kian-huat Ong, Kok-leong Ong, Wee-Keong Ng et al. · 2002
Effective visualization is an important aspect of active data mining. In the context of association rules, this need has been driven by the large amount of rules produced from a run of the algorithm. To be able to address real user needs, the rules need to be summarized and organized so that it can be interpreted and applied in a timely manner. In this paper, we propose two visualization techniques that is an improvement over those used by existing data mining packages. In particular, we address the visualization of "differences" in the set of rules due to incremental changes in the data source. We show that visualization in this aspect is important to active data mining as it uncovers new insights not possible from inspecting individual data mining results.
Cited by 0
Georg Gottlob, Guido Moerkotte, V. S. Subrahmanian · Lecture notes in computer science · 1996
Cited by 21
Sharma Chakravarthy, S. Varkala · 2006
Currently, many applications that require monitoring (e.g., surveillance, track monitoring) use the event-condition-action (or ECA) rule paradigm. The local event detector (LED) that has been developed based on the ECA rule paradigm provides active capability to various applications including relational database systems. LED is capable of handling events that are local to the application, thus providing active capability. Existing LED framework (in Java) supports creation of events and rules at compile time. Modifications to existing rules or events are difficult once the execution of the application begins. Thus, modifying rules or events requires adding code for new rules and events, recompiling and executing. This is a limitation for many applications where the rules and events need to be modified dynamically at run time and without bringing the system down. This paper provides a novel approach for supporting the creation of rules and events dynamically at run time, which is critical for several classes of monitoring applications. The proposed approach avoids recompilation and restarts which are inappropriate in many environments that require fine-tuning of rules on the fly. The dynamic programming environment (DPE) presented in this paper provides a generic set of classes that are designed to handle the creation, management, and execution of rules. This set of generic classes is application-independent making the system a general-purpose tool. The user application provides necessary class and event information to the DPE in either XML or text format. The DPE uses this information to create, modify and manage the rules. The DPE supports the creation of new composite and temporal events. A friendly user interface is provided to perform all these tasks.
Cited by 2
ktqlkizs · Zenodo (CERN European Organization for Nuclear Research) · 2024
<pre><code>\n<p><strong>active and passive voice rules pdf</strong><br></p>\n<p>Rating: 4.9 / 5 (2961 votes)<br></p>\n<p>Downloads: 42803<br><br></p>\n <p>= = = = = \n<strong><a href="https://myvroom.fr/21Nr9y?keyword=active and passive voice rules pdf" target="_blank">CLICK HERE TO DOWNLOAD</a></strong>\n = = = = = <br><br></p>\n<p><br><br><br><br></p>\n<p><br><br><br><br></p>\n<p><br><br>When we use the passive voice, we can also sometimes choose to avoid saying who did the action (the 'agent'). In the above example of an active sentence, the simple subject is "chef" and Choosing passive voice allows the writer to use "paper" as the subject of the sentence. But: They let us goWe were let goActive verbs are stronger and usually more emphatic than forms of the verb "be" or verbs in the passive voice. Active voice is the more common "SVO" (subject-verb-object) arrangement. See all my exercises about the passive here. Answers to the Active/Passive Voice Worksheet We use the passive when we want to show that the person/thing experiencing the action, is more important than who or what is performing the action. She made him do it. Example: The article (object) was published (verb). He was made to do it. A knife was used to commit the We would like to show you a description here but the site won't allow more What to Know. The printable worksheet includes a space for students to write one of their own active and passive sentences. example (1): The computer will be repaired tomorrow Passive with verbs followed by the infinitive without to In the active some verbs are followed by the infinitive without to. Active and Download this explanation in PDF here. In this order, the agent (person or thing doing the action) is known and appears before the verb. Compare these two examples of the passive voice and active voice (verbs in the passive verbs shaded): Passive Voice Example. Passive voice, on the other hand, switches the order of sentence elements to "OVS" or Passive voice can also be used the subject is unknown or unimportant to the purpose of the sentence. For example: The chocolate was eaten (by the children). Three alternative approaches were analysed (by the authors of the report). This is appropriate when the focus is on the highway project, not on the workers completing it. Active: The award-winning chef prepares each meal with loving care. (the subject) So, in the passive voice, the most important thing or person becomes the subject of the sentence. Worksheetthe passive pdf; Passivesimple present; Passive voicepresent simple; Passive voicelevel 1; Passive voicepdf Make passive Make active. To connect ideas in different clauses or sentences more clearly passive voice. Active: We saw them come. The money was stolen by her husband. The new highway will be completed sometime next month. 1 day ago · If we want to show the person or thing doing the action, we use by: She was attacked by a dangerous dog. An active sentence like I drank two cups of coffee has the subject first (the person or thing Passive voice Worksheetspdf exercises. In the passive we use most such verbs with the infinitive with to. HOW TO FORM THE PASSIVE In English, all sentences are written in either passive or active voice. Transforming Passive Sentences into Active Sentences To change passive voice to active voice, move the subject to the beginning of the sentence and use a verb to connect it to the object Passive: They were seen to come. Then, rewriting sentences from active to passive and vice versa. Comparing the Passive Voice and Active Voice To identify a verb in the passive voice, identify its subject and then determine that the subject is being acted upon. Passive: Each meal is prepared with loving care by the award-winning chef. When a sentence is in the active voice, the subject of the sentence is the one doing the action expressed by the the passive voice, the subject is the person or thing acted on or affected by the verbs passive voice is typically formed with a form of the verb be—such as is, was, or has been—and the past participle of the verb, एक्टिव और पैसिव वॉइस (Active and Passive Voice Meaning In Hindi) Active and Passive Voice का हिन्दी meaning कर्तृवाच्य और कर्मवाच्य होता है। कर्तृवाच्य मे कर्ता Active होता है The active/passive voice worksheet involves labeling sentences as active or passive and identifying the doer of action.</p></code></pre>
Cited by 0Open access
Christine Collet, Javam C. Machado · Workshops in computing · 1996
Cited by 11
Ivar Hagen · 1996
Cooperative problem solving (CPS) will play a major role in future information systems. Today's active and heterogeneous database management systems are part of the technology we need to explore and integrate into a CPS environment. It has been claimed that we have the necessary techniques and abstractions for formulating viable solutions to some of the problems existing when an integration is attempted. In this dissertation...
Cited by 0
1995
Abstract Active databases are an important topic of current database research. However, the semantics of the underlying mechanism, event-condition-action rules (or ECA rules for short), is unclear so far. In order to define a clear semantics for sets of active rules, we first derive the requirements such a semantics must fulfill. Since currently no semantics fulfills these requirements, we continue with the definition of the PARK semantics adhering to all requirements. The PARK semantics is a smooth integration of inflationary fixpoint semantics [6] with conflict resolution. Through this approach, the PARK semantics is powerful enough to deal with recursive active rules. Furthermore, the actual conflict resolution strategy is a parameter of the PARK semantics. This guarantees a wide range of applicability. 1 Introduction During the last few years, there has been increasing interest in active database systems. Independent of the underlying data model, event-condition-action rules [7] are at the core of all approaches. Since the introduction of ECA rules, many different languages for ECA rules have been proposed and quite a few prototype systems have been built. (For an overview see [2, 1].) Nevertheless, current research falls short of supplying a clean semantics for these systems. It is our intention to fill this gap.
Cited by 0
Bertram Ludäscher, Ulrich Hamann, Georg Lausen · 1995
We present a state-oriented extension to Datalog called Statelog which comprises two kinds of rules within a simple, yet flexible unified framework, i.e. (i) passive query rules used to express queries and static integrity constraints, and (ii) active transition rules for defining state-changing operations. We show that Statelog is powerful enough to capture many typical active rule applications (including complex updates, integrity enforcement and incremental view maintenance strategies) while retaining a declarative, set-oriented, and deterministic semantics thus reconciling active and deductive databases. Using the Statelog framework, formal results on termination, expressiveness and complexity of active rules are established which carry over to related state-oriented languages like XY-stratified Datalog. We prove that it is undecidable for general Statelog programs whether a program terminates on all databases. We then develop syntactic criteria which guarantee program t...
Cited by 0
GERVASI V, RAFFAETA', Alessandra · ARCA (Università Ca' Foscari Venezia) · 1997
Cited by 0
Leopoldo Bertossi, Javier Pinto · Lecture notes in computer science · 2000
Cited by 10