Soft computing with partial truth and graded logic functions

Date: 
Wednesday, April 9, 2008 - 17:30
Location: 
TH 331
Presenter: 
Jozo Dujmović, San Francisco State University
Abstract: 
We will present basic concepts of soft computing, where everything is a matter of degree. In particular, we will investigate the design and use of decision models that use continuous preference logic (CPL) functions for processing of partial truth. Basic CPL functions include hard and soft partial conjunction, hard and soft partial disjunction, neutrality, and conjunctive and disjunctive partial absorption. These functions are the theoretical background for the LSP method for evaluation of complex alternatives. The LSP method can be used in medical applications for evaluation of disease severity and patient disability. We will use as an example peripheral neuropathy, a common neurological condition with many causes and a wide range of severities. LSP models can incorporate both subjective symptoms and objective impairments; can be used by both doctors and patients to quantitatively evaluate the current level of severity or disability; and can be applied serially to analyze the progression of disease over time, and response to treatment. This method is generally applicable to all medical evaluations where it is important to create precise quantitative severity or disability models based on sophisticated logic conditions.
Bio: 

Jozo J. Dujmović was born in Dubrovnik, Croatia, and received the Dipl. Ing. degree in electronic and telecommunication engineering in 1964, and the M.Sc. and Sc.D. degrees in computer engineering, in 1973 and 1976 respectively, all from the University of Belgrade, Serbia. Since 1994 he has been Professor of Computer Science at San Francisco State University, where he served as Chair of Computer Science Department from 1998 to 2002. His teaching and research activities are in the areas of soft computing, software metrics and computer performance evaluation. In 1973 he introduced the concepts of andness and orness and logic aggregators based on continuous transition from conjunction to disjunction. He is the author of approximately 130 refereed publications, including 13 books and book chapters. Before his current position at San Francisco State University, he was Professor of Computer Science at the University of Belgrade, University of Florida (Gainesville), University of Texas (Dallas), and Worcester Polytechnic Institute. In addition, he was teaching in the graduate Computer Science programs at the National Universities of San Luis and Jujuy (both in Argentina). At the University of Belgrade, where he was teaching from 1968 to 1992, he also served as Chairman of Computer Science Department, and as founding Director of the Belgrade University Computing Center. His industrial experience includes work in the Institute M. Pupin in Belgrade, and consulting in the areas of decision methods, performance evaluation, and software design.

Prof. Dujmović is the recipient of three best paper awards, and a Senior Member of IEEE. He is an editor of Informatica, and served as General Chair of the Eight IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2000), and as General Chair of the Fourth ACM International Workshop on Software and Performance (WOSP 2004).