Computing a T-transitive lower approximation or opening of a proximity relation

Fuzzy Sets and Systems. IMPACT FACTOR: 1,181. Fuzzy Sets and Systems. IMPACT FACTOR: 1,181. Since transitivity is quite often violated even by decision makers that accept transitivity in their preferences as a condition for consistency, a standard approach to deal with intransitive preference elicitations is the search for a close enough transitive preference relation, assuming that such a violation is mainly due to decision maker estimation errors. In some way, the more number of elicitations, the more probable inconsistency is. This is mostly the case within a fuzzy framework, even when the number of alternatives or object to be classified is relatively small. In this paper we propose a fast method to compute a T-indistinguishability from a reflexive and symmetric fuzzy relation, being T any left-continuous t-norm. The computed approximation we propose will take O(n3) time complexity, where n is the number of elements under consideration, and is expected to produce a T-transitive opening. To the authors¿ knowledge, there are no other proposed algorithm that computes T-transitive lower approximations or openings while preserving the reflexivity and symmetry properties

An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity

A method to compute the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is given. Other previous methods in literature compute just the transitive closure, some transitive approximations or some transitive openings. The proposed algorithm computes the three different similarities that approximate a proximity for the computational cost of computing just one. The shape of the binary partition tree for the three output similarities are the same.Peer ReviewedPostprint (published version

Adaptive business rules framework for workflow management

Changing scattered and dynamic business rules in Business Workflow Systems has become a growing problem that hinders the use and configuration of workflow-based applications. There is a gap in the existing research studies which currently focus on solutions that are application specific, without accounting for the universal logical dependencies between the business rules and, as a result, do not support adaptation of the business rules in real time. Design/methodology/approach – To tackle the above problems, this paper adopts a bottom-up approach, which puts forward a component model of the business process workflows and business rules based on purely logical specification which allows incremental development of the workflows and indexing of the rules which govern them during the initial acquisition and real-time execution. Results – The paper introduces a component-based event-driven model for development of business workflows which is purely logic based and can be easily implemented using an object-oriented technology together with a formal model for accounting the business rules dependencies together with a new method for incremental indexing of the business rules controlling the workflows. It proposes a two-level inference mechanism as a vehicle for controlling the business process execution and adaptation of the business rules at real time based on propagating the dependencies between the rules. Originality/value –The major achievement of this research is the universal, strictly logic-based event-driven framework for business process modelling and control which allows automatic adaptation of the business rules governing the business workflows based on accounting for their structural dependencies. An additional advantage of the framework is its support for object-oriented technology which can be implemented with enterprise-level quality and efficiency. Although developed primarily for application in construction industry the framework is entirely domain-independent and can be used in other industries, too

Gesclident 2008: soporte software clínica dental

El objetivo de este proyecto es el desarrollo de una aplicación para la gestión de una clínica dental con accesibilidad a través de la Web utilizando tecnologías en auge como MYSQL o PHP 5 que permiten tener un completo control de Bases De Datos desde cualquier punto. Los elementos básicos de información y organización tradicionales tales como agendas o grandes almacenes con fichas de pacientes van a quedar obsoletos gracias a este sistema de gestión. Otro objetivo es proporcionar al paciente un acercamiento a toda su información a través de la red teniendo acceso a todo su historial así como a los presupuestos y pagos realizados. Esta herramienta es flexible, abierta y ampliable de modo que se mejora la gestión, el acceso, la interactividad y la utilidad de la gran cantidad de información de la que se dispone en un negocio de estas características ya que está adaptada para cualquier tipo de usuario (con conocimientos avanzados de informática o sin ellos) además de mejorar la experiencia del paciente. [ABSTRACT] The aim of this project is to develop an application for managing a dental clinic with accessibility via the Web using technologies booming as MYSQL or PHP 5 which they allow complete control of databases from anywhere. The basic elements of organization and information such as calendars or traditional department stores with tokens of patients will become obsolete with this management system. Another objective is to provide the patient a rapprochement with all their information through the network to have access to all of its history as well as budgets and payments. This tool is flexible, scalable and open so as to improve management, access, interactivity and usefulness of the vast amount of information that is available in a business of this nature because it is suited for any type of user (with advanced computer knowledge or without them). In addition it improves the patient experience