Contents of Fundamenta Informaticae Volume 111

Number 1,  2011

Number 2,  2011

Number 3,  2011

Number 4,  2011

Contents of Volume 111, Number 1, 2011

Click on title for abstract

Knowledge Technology. Preface.

Double Approximation and Complete Lattices
Taichi Haruna,  Yukio-Pegio Gunji

Attribute Reduction in Formal Contexts: A Covering Rough Set Approach
Tong-Jun Li,  Wei-Zhi Wu

The Construction of Fuzzy Concept Lattices Based on (q,s)-Fuzzy Rough Approximation Operators
Yanqing Yao,  Jusheng Mi,  Zhoujun Li,  Bin Xie

Approximation Operators, Binary Relation and Basis Algebra in L-fuzzy Rough Sets
Zhengjiang Wu,  Tianrui Li,  Keyun Qin,  Da Ruan

Kernelized Fuzzy Rough Sets Based Yawn Detection for Driver Fatigue Monitoring
Yong Du,  Qinghua Hu,  Degang Chen,  Peijun Ma

A Novel Multimodal Probability Model for Cluster Analysis
Jian Yu,  Miin-Shen Yang,  Pengwei Hao

Object-Oriented Inheritance Metrics in the Context of Cognitive Complexity
Deepti Mishra,  Alok Mishra

Contents of Volume 111, Number 2, 2011

Click on title for abstract

On the Generative Power of w-Grammars and w-Automata
Zhe Chen

Infinite Traces and Symbolic Dynamics - the Minimal Shift Case
Wit Foryś,  Piotr Oprocha

Weighted Extended Tree Transducers
Zoltán Fülöp,  Andreas Maletti,  Heiko Vogler

Solution to the Range Problem for Combinatory Logic
Benedetto Intrigila,  Richard Statman

Rough Truth Degrees of Formulas and Approximate Reasoning in Rough Logic
Yanhong She,  Xiaoli He,  Guojun Wang

Forward-Secure Identity-Based Public-Key Encryption without Random Oracles
Jia Yu,  Fanyu Kong,  Xiangguo Cheng,  Rong Hao,  Jianxi Fan

Contents of Volume 111, Number 3, 2011

Click on title for abstract

A Nonmonotonic Soft Concurrent Constraint Language to Model the Negotiation Process
Stefano Bistarelli,  Francesco Santini

Properties Complementary to Program Self-Reference
John Case,  Samuel E. Moelius III

Self-Indexed Grammar-Based Compression
Francisco Claude,  Gonzalo Navarro

Runtime Monitoring of Contract Regulated Web Services
Alessio Lomuscio,  Wojciech Penczek,  Monika Solanki,  Maciej Szreter

Contents of Volume 111, Number 4, 2011

Click on title for abstract

Reduction Techniques for Acyclic Cover Transducers
Jean-Marc Champarnaud,  Jacques Farré,  Franck Guingne

Mop: An Efficient Algorithm for Mining Frequent Pattern with Subtree Traversing
Zhi-Hong Deng,  Ning Gao,  Xiao-Ran Xu

Efficient Algorithms for Games Played on Trees with Back-edges
Aniruddh Gandhi, Bakhadyr Khoussainov,  Jiamou Liu

A Lower Bound of the Second-order Nonlinearities of Boolean Bent Functions
Manish Garg,  Sugata Gangopadhyay

Spiking Neural dP Systems
Mihai Ionescu,  Gheorghe Paun,  Mario J. Pérez-Jiménez,   Takashi Yokomori

Rainbow Induced Subgraphs in Proper Vertex Colorings
Andrzej Kisielewicz,  Marek Szykuła

Computing k-block Morphisms by Spiking Neural P Systems
Taishin Yasunobu Nishida