Showing papers in "Information Sciences in 2003"

TL;DR: It has been proved that the reduct of a covering is the minimal covering that generates theSame covering lower approximation or the same covering upper approximation, so this concept is also a technique to get rid of redundancy in data mining.

TL;DR: This paper presents a general framework for the study of fuzzy rough sets in which both constructive and axiomatic approaches are used and the connections between fuzzy relations and fuzzy rough approximation operators are examined.

TL;DR: The aim of the paper is to solve facility location problems using different solution approaches of fuzzy multi-attribute group decision-making, including a fuzzy model of group decision proposed by Blin and Yager's weighted goals method.

TL;DR: It is shown that fuzzy set approach produces more consistent models (in terms of their performance), and how the power law of granularity helps construct mappings between system's variables in rule-based models.

TL;DR: Examination of current trends in the e-commerce revolution in the Malaysian banking sector and an empirical research carried out to study the customers' preference for electronic banking and the factors, which they considered influenced the adoption of electronic banking indicate that while there is no significant differences between the age and educational qualifications of the electronic and conventional banking users, some differences exists on other demographic variables.

TL;DR: Agent-based computational economics (ACE) as mentioned in this paper is the computational study of economies modeled as evolving systems of autonomous interacting agents, which is a specialization to economics of the basic complex adaptive systems paradigm.

TL;DR: The concept of a maximal consistent block is applied to formulate a new approximation to an object set in incomplete information systems with higher level of accuracy and can provide a more efficient computation for knowledge acquisition, especially in large incomplete systems.

TL;DR: An arc of a fuzzy graph is called strong if its weight is at least as great as the strength of connectedness of its end nodes when it is deleted.

TL;DR: A theoretical approach is proposed to capture the essence of artists' insights with 14 aesthetic measures for graphic displays that are important to prospective viewers and may help gain attention and build confidence in using computer system.

TL;DR: The linearity of a scalar value expected value operator of fuzzy random variable is discussed, and a fuzzy random simulation approach is suggested to evaluate the expected value of a fuzzyrandom variable.

TL;DR: A parameter-less adaptive penalty scheme for genetic algorithms applied to constrained optimization problems is proposed and the performance of this new scheme is examined using test problems from the evolutionary computation literature as well as structural engineering constrained optimized problems.

TL;DR: Control simulation results show that by using the fuzzy controller, the crane is smoothly driven to the destination in short time with small swing angle and almost no overshoot.

TL;DR: In this paper, the authors review and compare the current PON-based FTTH solutions, ATM-PON (APON) and Ethernet PON (EPON), and provide a possible evolution scenario to future WDMPON.

TL;DR: It is shown that M-strong fuzzy graph G is a fuzzy tree if and only if the support(G) is a tree and that Gcc is the smallest M- Strong fuzzy graph that contains G and G = Gcc if andonly if G is M- strong.

TL;DR: It is shown that no node can be both a cut node and a fuzzy end node in a fuzzy graph, and any nontrivial fuzzy tree has at least two fuzzy end nodes.

TL;DR: It is shown that any fuzzy relation R on an arbitrary universe X has a T - transitive closure and this existential result can be turned into an explicit expression in the case of a left-continuous triangular norm T .

TL;DR: A switching static output-feedback fuzzy-model-based controller is designed by solving some linear matrix inequalities (LMI), which are derived from the developed local representations.

TL;DR: This paper proposes a new approach to feature selection based on a modified fuzzy C-means algorithm with supervision (MFCMS), and shows that feature selection performed by MFCMS achieved an improvement in generalization on all data sets.

TL;DR: Analytical formulas are derived for Renyi and Shannon entropies, as well as, for Song's measure, for 26 flexible families of univariate continuous distributions, for some standard continuous distributions.

TL;DR: The Small Gain Theorem is applied to the derived structures of the fuzzy controllers of Takagi-Sugeno fuzzy PI and PD controllers and it is mathematically proved to be nonlinear PI (or PD) controllers with proportional-gain and integral-gain changing with output of the controlled system.

TL;DR: A Markov model is employed to study the relative performance of binary and Gray coding in genetic algorithms and indicates that while there is not much difference between the two, Gray coding does not necessarily improve performance for functions which have fewer local optima in the Gray representation than in binary.

TL;DR: A new algorithm to tackle the rate of aggregative risk in fuzzy circumstances by fuzzy sets theory during any phase of the life cycle during anyphase of theLife cycle is presented.

TL;DR: These methods enable a robot to learn linguistic knowledge from scratch in unsupervised ways through statistical optimization in the process of human-robot communication, combining speech, visual, and behavioral information in a probabilistic framework.

TL;DR: InfoGrid as mentioned in this paper is a data integration middleware engine designed to operate under a Grid framework, which focuses on providing information access services and offers all users a query system which is able to retain the familiarity with their specific scientific applications while being diverse, flexible and open at the same time.

TL;DR: A pursuing system utilizing the artificial life concept where autonomous mobile robots emulate social behaviors of animals and insects and realize their group behaviors is proposed and the validity of the system is verified through simulation.

TL;DR: A new spatial-relationship representation model called "two dimension begin-end boundary string" (2D Be-string), which can intuitively and naturally represent the pictorial spatial information without any spatial operator, is proposed and a method of evaluating image similarities, based on the modified "longest common subsequence" algorithm, is presented.

TL;DR: Examination of the generated rules in relation to known three-dimensional structures of members in the case of two families suggests that the proposed technique may be able to identify combinations of sequence motifs that characterize functionally significant three- dimensional structural features of proteins.

TL;DR: This paper attempts to capture the basic ideas of the adaptiveness in order to build new combination rules based on Hamacher's family of t-norms, and two families of rules will be put forward and compared to the adaptive rule of Dubois' and Prade's.

TL;DR: An algorithm is presented that systematically extracts the most relevant facts in the texts and labels them by their overall theme, dictated by local contextual information, and exploits domain independent lexical frequencies and mutual information measures to find the relevant contextual units in the text.

TL;DR: The merging process is based on the clustering concept where categories with similar characteristics are merged into the same cluster under certain distributed constraints and a performance measure called cluster entropy is proposed, which determines how well the categories from different sources are distributed over the resulting clusters.