Showing papers in "Information Sciences in 1997"

TL;DR: The idea of a rough left [right, two-sided, bi-] ideal in a semigroup is introduced, which is an extended notion of a left [ right,Two-sided], bi-, and some properties of such ideals are given.

TL;DR: A new implementation of LSI, LSI++, seeks to make LSI efficient, extensible, portable, and maintainable, and supports both serial and distributed searching of large data sets, providing the same programming interface regardless of the implementation actually executing.

TL;DR: This paper investigates adaptive learning, rule extraction and insertion, and neural/fuzzy reasoning for a particular model of a fuzzy neural network called FuNN, which incorporates a genetic algorithm in one of its adaptation modes.

TL;DR: The study results show that this method is an effective means for tackling MCDM problems in fuzzy and grey environments.

TL;DR: The proposed method can automatically and effectively find the brightness membership function for images by finding a membership function such that the corresponding fuzzy event has maximum entropy.

TL;DR: Through simulations, the dynamical behavior of CNFCMs is presented and the inference capabilities are illustrated in comparison to that of the classical FCM by means of an example.

TL;DR: Since the task assignment problem is NP-hard, three novel heuristic algorithms are presented that have been tested for solving it and compared to the well-known greedy heuristic.

TL;DR: The notion of the generalized sigmoid as an activation function for neurons in the output layer of an MLP network is introduced and the enhancements afforded by the use of this function are analyzed and demonstrated in the context of some well-known classification problems.

TL;DR: In this paper, the existence of the solutions of fuzzy differential equations with parameters with parameters by the topological degree method is studied.

TL;DR: The described transformation enables to solve the GTSP by applying some of the numerous TSP's heuristics or optimal approaches, and it is shown that any optimal solution of the TSP instance corresponds to a unique optimal Solution of theGTSP instance of no greater length.

TL;DR: This paper presents concurrency control algorithms that do not alter the original R-tree structure for range searches, insertions, and deletions that not only yield correct results, but also ensure deadlock freedom.

TL;DR: Particular emphasis is given, as used in this work, to the possibilities of using the fuzzy systems modeling technology as a tool for constructing aggregation functions from a specification of some properties of the desired operator.

TL;DR: A simulation of neural network systems for identifying computer users using keystroke intervals when typing a well-known phrase is presented, finding the identification technique presented here is accurate, practical, and novel.

TL;DR: This paper highlights the necessity of applying the rules with all possible consequent clauses in the procedure with the considerations of information quality and quantity, when applying the procedure to more general decision-making problems.

TL;DR: This method will have wide application in image processing and take account of the spatial gray-tone dependence; thus, using homogeneity vectors has a better noise tolerance.

TL;DR: In this survey, a number of different transaction routing mechanisms are discussed and their performance is discussed.

TL;DR: It is shown that coarsening and discount operations are not commutative with the orthogonal sum operation or with the discount operation, and some basic operations on evidential functions are discussed.

TL;DR: Axioms for defining a central value of a fuzzy set are developed and various proposed central values are examined.

TL;DR: A new method for automatic bandwidth selection of fuzzy membership functions is presented and it is shown that the proper bandwidths are determined automatically and the images are well segmented by the selected thresholds.

TL;DR: The proposed placement algorithm guarantees that each node without resource copy connects two (matching) nodes with resource copy, so that one of the resource copies at each matching pair can be used as a backup to tolerate possible processor failures.

TL;DR: In this article, the authors use constraints to provide a unifying framework for the most common types of nulls and show how viewing tuples containing null values of these types can be viewed as constraints and how this leads to an algebra for null values.

TL;DR: The application of large-scale ANN in modeling of industrial plants can be overcome by the use of the nonrandom initial connection weight algorithm, and the developed ANN model can then be optimized.

TL;DR: A motion planning method to cut a three-dimensional work piece by a redundant manipulator with six degrees of freedom that reduces the operators' labor, so that they only have to determine a path without considering redundant parameters.

TL;DR: In this paper, a distributed load-profiling protocol for dynamically scheduling time-constrained tasks in a loosely-coupled distributed environment is proposed, where the system attempts to distribute the load among its nodes so as to maximize the chances of finding a node that would satisfy the computational needs of incoming real-time tasks.

TL;DR: A generalization is introduced to investigate interactions between one or more positions on a chromosome, allowing a more accurate analysis of fitness landscape, and a problem of coding choice is finally solved.

TL;DR: Fuzzy controlled systems are considered and an on-line adaptation of fuzzy parameters is implemented and a Downhill Simplex algorithm is carefully examined.

TL;DR: A methodology of studying the complex phenomena emerging in stock markets based on the use of distributed multi-agent models with minimal knowledge representation and reasoning capabilities that have proven to be a powerful modeling tool for complex biological systems is presented.

TL;DR: It is observed that multiversion outperforms wound-wait in both partitioned and partially replicated databases, and in the partially replicated case, 50% write does not show the lowest performance, as observed in the partitioned case.

TL;DR: This work considers the problem of locating two unknown elements x, y using group testing devices and provides optimal algorithms to search for x and y.