Follow this and additional works at: http://engagedscholarship.csuohio.edu/enece_facpub Part of the Computer Engineering Commons Publisher's Statement NOTICE: this is the author’s version of a work that was accepted for publication in International Journal of Approximate Reasoning. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, a...

Tight connections between leaf languages and strings compressed by straightline programs (SLPs) are established. It is shown that the compressed membership problem for a language L is complete for the leaf language class defined by L via logspace machines. A more difficult variant of the compressed membership problem for L is shown to be complete for the leaf language class defined by L via pol...

Given a fuzzy logic system, how can we determine the membership functions that will result in the best performance? If we constrain the membership functions to a speci ̄c shape (e.g., triangles or trapezoids) then each membership function can be parameterized by a few variables and the membership optimization problem can be reduced to a parameter optimization problem. The parameter optimization ...

Data envelopment analysis (DEA) is a method to evaluate the relative efficiency of decision making units (DMUs). In this method, the issue has always been to determine a set of weights for each DMU which often caused many problems. Since the DEA models also have the multi-objective linear programming (MOLP) problems nature, a rational relationship can be established between MOLP and DEA problem...