FUIN 2006 - PDF Preprint Papers

FUIN 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FUIN-2006 Paper

click to vote

FUIN
2006

160views more FUIN 2006»

Behavioral Pattern Identification Through Rough Set Modeling

13 years 6 months ago

Download logic.mimuw.edu.pl

This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems. Rough set theory introduced by Zdzisl...

Jan G. Bazan

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	160	Behavioral Pattern Identification Through Rough Set Modeling	claim
2	145	Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming	claim
3	142	Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol	claim
4	139	Efficient Parallel Query Processing by Graph Ranking	claim
5	132	Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation	claim
6	128	A Rewriting Framework for Rule-Based Programming Dynamic Applications	claim
7	125	Associative Omega-product of Processes	claim
8	120	On the Axioms of Residuated Structures: Independence, Dependencies and Rough Approximations	claim
9	113	Adaptive Merging of Prioritized Knowledge Bases	claim
10	112	A Calculus of Looping Sequences for Modelling Microbiological Systems	claim
11	111	Typing the Behavior of Software Components using Session Types	claim
12	107	Learning Sunspot Classification	claim
13	106	Architectural Principles and Scheduling Strategies for Computing Agent Systems	claim
14	105	Spiking Neural P Systems	claim
15	103	A Categorical View on Algebraic Lattices in Formal Concept Analysis	claim
16	98	On-line Approximate String Matching in Natural Language	claim
17	97	Thread Algebra with Multi-Level Strategies	claim
18	97	Interactive Systems with Registers and Voices	claim
19	96	A Component Coordination Model Based on Mobile Channels	claim
20	95	Multistrategy Operators for Relational Learning and Their Cooperation	claim
21	95	Bounds for Validation	claim
22	93	Membrane Computing and Economics: Numerical P Systems	claim
23	93	Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers	claim
24	91	P Systems with Proteins on Membranes	claim
25	90	Local Computations in Graphs: The Case of Cellular Edge Local Computations	claim
26	89	Recursive Analysis Characterized as a Class of Real Recursive Functions	claim
27	89	(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes	claim
28	88	Calculi of Approximation Spaces	claim
29	85	Implementing Typeful Program Transformations	claim
30	85	Higher Order Deforestation	claim
31	85	Towards Integrated Verification of Timed Transition Models	claim
32	85	Decidability and Universality in Symbolic Dynamical Systems	claim
33	84	Nondeterministic Bimachines and Rational Relations with Finite Codomain	claim
34	81	Redundant Call Elimination via Tupling	claim
35	81	Indexing Schemes for Similarity Search: an Illustrated Paradigm	claim
36	80	Update and Abstraction in Model Checking of Knowledge and Branching Time	claim
37	79	Simple Gene Assembly Is Deterministic	claim
38	79	Automata Recognizing No Words: A Statistical Approach	claim
39	78	Resource-Constrained Workflow Nets	claim
40	77	The Impact of seq on Free Theorems-Based Program Transformations	claim
41	75	Shuffle of Words and Araucaria Trees	claim
42	73	On the Computational Power of 1-Deterministic and Sequential P Systems	claim
43	70	Modelling Global and Local Name Spaces for Mobile Agents Using Object Nets	claim
44	69	An Efficient and Secure Cryptosystem for Encrypting Long Messages	claim
45	68	Program Transformation with Scoped Dynamic Rewrite Rules	claim
46	68	Expressing and Verifying Temporal and Structural Properties of Mobile Agents	claim
47	67	On minimal models of the Region Connection Calculus	claim
48	66	Observation of String-Rewriting Systems	claim
49	64	Foundations on Coordination Languages and Software Architectures	claim
50	64	Injectivity of the Parikh Matrix Mappings Revisited	claim
51	63	Surface Properties from N-Views of a Strictly Convex Solid	claim
52	63	Interpreted Trajectories	claim
53	56	Slicing of Timed Automata with Discrete Data	claim
54	47	A Low-complexity Distance for DNA Strings	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers