Sciweavers

1998 search results - page 156 / 400
» Basic Association Rules
Sort
View
RAID
1999
Springer
15 years 7 months ago
Combining Knowledge Discovery and Knowledge Engineering to Build IDSs
We have been developing a data mining (i.e., knowledge discovery) framework, MADAM ID, for Mining Audit Data for Automated Models for Intrusion Detection [LSM98, LSM99b, LSM99a]. ...
Wenke Lee, Salvatore J. Stolfo
138
Voted
CORR
2010
Springer
165views Education» more  CORR 2010»
15 years 2 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu
TIME
2006
IEEE
15 years 8 months ago
Temporal Arithmetic Mixing Months and Days
In this paper, we present our work on creating a complete set of rules for temporal arithmetic mixing months and days based on the “history-dependent intuition”. Many examples...
Feng Pan, Jerry R. Hobbs
112
Voted
BPM
2003
Springer
123views Business» more  BPM 2003»
15 years 6 months ago
A Top-Down Petri Net-Based Approach for Dynamic Workflow Modeling
A top-down approach for workflow design is proposed in the framework of Petri net theory. Simple but powerful refinement rules are proposed that guarantee soundness of the resultin...
Piotr Chrzastowski-Wachtel, Boualem Benatallah, Ra...
101
Voted
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
15 years 4 months ago
Controllability decompositions of networked systems through quotient graphs
In this paper we study decentralized, networked systems whose interaction dynamics are given by a nearestneighbor averaging rule. By letting one node in the network take on the rol...
Simone Martini, Magnus Egerstedt, Antonio Bicchi