• FINDER Search
• Submission
• Subscription
• About Us
• E-shop

JACIII Vol.10 No.5 Sep. 2006

Rough Sets and Granular Computing

Guest Editor: Hiroshi Sakai and Masahiro Inuiguchi

Web Services Practices

Guest Editor: Ajith Abraham, Sung-Bae Cho, Thomas Hite,
and Sang-Yong Han

If you want to search by keywords, please jump to FINDER Search.

• Table of Contents
• About this journal
• For Authors
• Back Numbers
• Contact

Editorial:

Special Issue on Rough Sets and Granular Computing

Hiroshi Sakai and Masahiro Inuiguchi, pp. 605-605

Rough sets and granular computing, known as new methodologies for computing technology, are now attracting great interest of researchers.
This special issue presents 12 articles, and most of them were presented at the second Japanese workshop on Rough Sets held at Kyushu Institute of Technology in Tobata, Kitakyushu, Japan, on August 17-18, 2005. The first article studies the relation between rough set theory and formal concept analysis. These two frameworks are analyzed and connected by using the method of morphism. The second article introduces object-oriented paradigm into rough set theory, and object-oriented rough set models are proposed. Theoretical aspects of these new models are also examined. The third article considers relations between generalized rough sets, topologies and modal logics, and some topological properties of rough sets induced by equivalence relations are presented. The fourth article focuses on a family of polymodal systems, and theoretical aspects of these systems, like the completeness, are investigated. By means of combining polymodal logic concept and rough set theory, a new framework named multi-rough sets is established. The fifth article focuses on the information incompleteness in fuzzy relational models, and a generalized possibility-based fuzzy relational model is proposed. The sixth article presents a developed software EVALPSN (Extended Vector Annotated Logic Program with Strong Negation) and the application of this software to pipeline valve control. The seventh article presents the properties of attribute reduction in variable precision rough set models.
Ten kinds of meaningful reducts are newly proposed, and hierarchical relations in these reducts are examined.
The eighth article proposes attribute-value reduction for Kansei analysis using information granulation, and illustrative results for some databases in UCI Machine Learning Repository are presented. The ninth article investigates cluster analysis for data with errors tolerance.
Two new clustering algorithms, which are based on the entropy regularized fuzzy c-means, are proposed. The tenth article applies binary decision trees to handwritten Japanese Kanji recognition. The consideration to the experimental results of real Kanji data is also presented. The eleventh article applies a rough sets based method to analysing the character of the screen-design in every web site. The obtained character gives us good knowledge to generate a new web site. The last article focuses on rule generation in non-deterministic information systems. For generating minimal certain rules, discernibility functions are introduced. A new algorithm is also proposed for handling every discernibility function.

Finally, we would like to acknowledge all the authors for their efforts and contributions. We are very grateful to reviewers for their thorough and on-time reviews, too. We are also grateful to Prof. Toshio Fukuda and Prof. Kaoru Hirota, Editors-in-Chief of JACIII, for inviting us to serve as Guest Editors of this Journal, and to Mr. Uchino and Mr. Ohmori of Fuji Technology Press for their kind assistance in publication of this special issue.

top

Paper:

Rough Set Approximation as Formal Concept

Nozomi Ytow, David R. Morse, and David McL. Roberts, pp. 606-611

Abstract | Full-text (PDF100KB)

Paper:

A Theoretical Formulation of Object-Oriented Rough Set Models

Yasuo Kudo and Tetsuya Murai, pp. 612-620

Abstract | Full-text (PDF128KB)

Paper:

Topological Structures of Rough Sets Induced by Equivalence Relations

Michiro Kondo and Wieslaw A. Dudek, pp. 621-624

Abstract | Full-text (PDF61KB)

Paper:

A Family of Polymodal Systems and its Application to Generalized Possibility Measures and Multi-Rough Sets

Sadaaki Miyamoto, Tetsuya Murai, and Yasuo Kudo, pp. 625-632

Abstract | Full-text (PDF95KB)

Paper:

Generalizing Possibility-Based Fuzzy Relational Models

Michinori Nakata, pp. 633-646

Abstract | Full-text (PDF173KB)

top

Paper:

Pipeline Valve Control Based on EVALPSN Safety Verification

Kazumi Nakamatsu, pp. 647-656

Abstract | Full-text (PDF143KB)

Paper:

Structure-Based Attribute Reduction in Variable Precision Rough Set Models

Masahiro Inuiguchi,pp. 657-665

Abstract | Full-text (PDF148KB)

Paper:

Reduction of Attribute Values for Kansei Representation

Yuji Muto, Mineichi Kudo, and Tetsuya Murai, pp. 666-672

Abstract | Full-text (PDF176KB)

Paper:

On Fuzzy c-Means for Data with Tolerance

Ryuichi Murata, Yasunori Endo, Hideyuki Haruyama, and Sadaaki Miyamoto, pp. 673-681

Abstract | Full-text (PDF206KB)

Paper:

An Application of Binary Decision Trees to Pattern Recognition

Noboru Takagi, pp. 682-687

Abstract | Full-text (PDF136KB)

top

Paper:

Analysis of Specifications for Web Screen-Design Using Rough Sets

Toshinobu Harada and Ryousuke Tanaka, pp. 688-694

Abstract | Full-text (PDF585KB)

Paper:

An Application of Discernibility Functions to Generating Minimal Rules in Non-Deterministic Information Systems

Hiroshi Sakai and Michinori Nakata, pp. 695-702

Abstract | Full-text (PDF114KB)

top

Special Issue

Editorial:

Special Issue on Web Services Practices

Ajith Abraham, Sung-Bae Cho, Thomas Hite, and Sang-Yong Han, pp. 703-704

Web services – a new breed of self-contained, self-describing, modular applications published, located, and invoked across the Web – handle functions, from simple requests to complicated business processes. They are defined as network-based application components with a services-oriented architecture (SOA) using standard interface description languages and uniform communication protocols. SOA enables organizations to grasp and respond to changing trends and to adapt their business processes rapidly without major changes to the IT infrastructure.

The Inaugural International Conference on Next-Generation Web Services Practices (NWeSP'05) attracted researchers who are also the world's most respected authorities on the semantic Web, Web-based services, and Web applications and services. NWeSP'05 was held in cooperation with the IEEE Computer Society Task Force on Electronic Commerce, the Technical Committee on Internet, and the Technical Committee on Scalable Computing.

This special issue presents eight papers focused on different aspects of Web services and their applications. Papers were selected based on fundamental ideas and concepts rather than the thoroughness of techniques employed. Papers are organized as follows:

Taher et al. present the first paper, on a Quality of Service Information and Computational framework (QoS-IC) supporting QoS-based service selection for SOA. The framework's functionality is expanded using a QoS constraints model that establishes an association relationship between different QoS properties and is used to govern QoS-based service selection in the underlying algorithm. Using a prototype implementation, the authors demonstrate how QoS constraints improve QoS-based service selection and save consumers valuable time.

Due to the complex infrastructure of web applications, response times perceived by clients may be significantly longer than desired. To overcome some of the current problems, Vilas et al., in the second paper, propose a cache-based extension of the architecture that enhances the current web services architecture, which is mainly based on program-logic or protocol-dependent optimization.

In the third paper, Jo and Yoo present authorization for securing XML sources on the Web. One of the disadvantages of existing access control is that the DOM tree must be loaded into memory while all XML documents are parsed to generate the DOM tree, such that a lot of memory is used in repetitive search for tree to authorize access to all nodes in the DOM tree. The complex authorization evaluation process required thus lowers system performance. Existing access control fails to consider information structure and semantics sufficiently due to basic HTML limitations. The authors overcome some of these limitations in the proposed model.

In the fourth paper, Jung and Cho propose a novel behavior-network-based method for Web service composition. The behavior network selects services automatically through internal and external links with environmental information from sensors and goals. An optimal service is selected at each step, resulting in a globally optimal service sequence for achieving preset goals. The authors detail experimental results for the proposed model by comparing them with rule-based system and user tests.

Kong et al. present an efficient method in the fifth paper for merging heterogeneous ontologies – no ontology building standard currently exists – and the many ontology-building tools available are based on different ontology languages, mostly focusing on how to create, edit and infer the ontology efficiently. Even ontologies about the same domain differ because ontology experts hold different view points. For these reasons, interoperability between ontologies is very low. The authors propose merging heterogeneous domain ontologies by overcoming some of the above limitations.

In the sixth paper, Chen and Che provide polynomial-time tree pattern query minimization algorithm whose efficiency stems from two key observations: (i) Inherent redundant "components" usually exist inside the rudimentary query provided by the user, and (ii) nonedundant nodes may become redundant when constraints such as co-occurrence and required child/descendant are given. They show that the algorithm obtained by first augmenting the input tree pattern using constraints, then applying minimization, invariably finds a unique minimal equivalent to the original query.

Chen and Che present a polynomial-time algorithm for tree pattern query (TPQ) minimization without XML constraints in the seventh paper. The two-part algorithm is a dynamic programming strategy for finding all matching subtrees within a TPQ. The algorithm consists of one for subtree recognization and a second for subtree deletion.

In the last paper, Bagchi et al. present the mobile distributed virtual memory (MDVM) concept and architecture for cellular networks containing server-groups (SG). They detail a two-round randomized distributed algorithm to elect a unique leader and co-leader of the SG that is free of any assumption about network topology, and buffer space limitations and is based on dynamically elected coordinators eliminating single points of failure.

As guest editors, we thank all authors featured in this special issue for their contributions and the referees for critically evaluating the papers within the short time allotted. We sincerely believe that readers will share our enjoyment of this special issue and find the information it presents both timely and useful.

top

Paper:

QoS Constrains Model: Establishing QoS Association for Ontology-Based Web Service Selection Mechanism

Laila Taher, Rawshan Basha, and Hazem El Khatib, pp. 705-712

Abstract | Full-text (PDF130KB)

Paper:

Optimizing Web Services Performance Using Cache

Julio Fernández Vilas, Jose J. Pazos Arias, and Ana Fernández Vilas, pp. 713-720

Abstract | Full-text (PDF186KB)

Paper:

An Efficient Authorization Mechanism for Secure XML Sources on the Web

Sun-Moon Jo and Weon-Hee Yoo, pp. 721-727

Abstract | Full-text (PDF227KB)

Paper:

Automatic Web Service Composition Based on Behavior Network

Myung-Chul Jung and Sung-Bae Cho, pp. 728-732

Abstract | Full-text (PDF238KB)

Paper:

Efficient Merging for Heterogeneous Domain Ontologies Based on WordNet

Hyunjang Kong, Myunggwon Hwang, and Pankoo Kim, pp. 733-737

Abstract | Full-text (PDF224KB)

top

Paper:

Efficient Processing of XML Tree Pattern Queries

Yangjun Chen and Dunren Che, pp. 738-743

Abstract | Full-text (PDF110KB)

top

Regular Paper

Paper:

Visual Cortex Inspired Intelligent Contour Detection

Barna Reskó, Zoltán Petres, András Róka, and Péter Baranyi, pp. 761-768

Abstract | Full-text (PDF342KB)

top