INFERENCE PROCEDURES FOR FUZZY KNOWLEDGE REPRESENTATION SCHEME

This article presents a formal model of the knowledge representation scheme based on the fuzzy Petri net (FPN) theory. The model is represented as a 13-tuple consisting of the components of the FPN, two functions that give semantic meanings to the scheme and a set of contradictions. For the scheme, called the knowledge representation scheme based on the fuzzy Petri nets theory (KRFPN) the fuzzy inheritance and fuzzy recognition-inference procedures based on the dynamical properties of the FPN, are described in detail. The upper-time complexity of both the proposed inference algorithms is O(nm), where n is the number of places (concepts) and m is the number of transitions (relations) in the scheme. Illustrative examples of the fuzzy inheritance and the fuzzy recognition algorithms for the knowledge base, designed by the KRFPN, are given.     

Decentralized fault detection and diagnosis via sparse PCA based decomposition and Maximum Entropy decision fusion

This paper proposes an approach for decentralized fault detection and diagnosis in process monitoring sensor networks. The sensor network is decomposed into multiple, potentially overlapping, blocks using the Sparse Principal Component Analysis algorithm. Local predictions are generated at each block using Support Vector Machine classifiers. The local predictions are then fused via a Maximum Entropy algorithm. Empirical studies on the benchmark Tennessee Eastman Process data demonstrated that the proposed decentralized approach achieves accuracy comparable to that of the fully centralized approach, while offering benefits in terms of fault tolerance, reusability, and scalability.     

Supervised clustering of label ranking data using label preference information

This paper studies supervised clustering in the context of label ranking data. The goal is to partition the feature space into K clusters, such that they are compact in both the feature and label ranking space. This type of clustering has many potential applications. For example, in target marketing we might want to come up with K different offers or marketing strategies for our target audience. Thus, we aim at clustering the customers’ feature space into K clusters by leveraging the revealed or stated, potentially incomplete customer preferences over products, such that the preferences of customers within one cluster are more similar to each other than to those of customers in other clusters. We establish several baseline algorithms and propose two principled algorithms for supervised clustering. In the first baseline, the clusters are created in an unsupervised manner, followed by assigning a representative label ranking to each cluster. In the second baseline, the label ranking space is clustered first, followed by partitioning the feature space based on the central rankings. In the third baseline, clustering is applied on a new feature space consisting of both features and label rankings, followed by mapping back to the original feature and ranking space. The RankTree principled approach is based on a Ranking Tree algorithm previously proposed for label ranking prediction. Our modification starts with K random label rankings and iteratively splits the feature space to minimize the ranking loss, followed by re-calculation of the K rankings based on cluster assignments. The MM-PL approach is a multi-prototype supervised clustering algorithm based on the Plackett-Luce (PL) probabilistic ranking model. It represents each cluster with a union of Voronoi cells that are defined by a set of prototypes, and assign each cluster with a set of PL label scores that determine the cluster central ranking. Cluster membership and ranking prediction for a new instance are determined by cluster membership of its nearest prototype. The unknown cluster PL parameters and prototype positions are learned by minimizing the ranking loss, based on two variants of the expectation-maximization algorithm. Evaluation of the proposed algorithms was conducted on synthetic and real-life label ranking data by considering several measures of cluster goodness: (1) cluster compactness in feature space, (2) cluster compactness in label ranking space and (3) label ranking prediction loss. Experimental results demonstrate that the proposed MM-PL and RankTree models are superior to the baseline models. Further, MM-PL is has shown to be much better than other algorithms at handling situations with significant fraction of missing label preferences.     

The Use of Object-Oriented Modeling for Water Resources Planning in Egypt

Water problems are omnipresent and are already becoming a limiting factor in the development of many countries. Currently the balance between the available and required water in Egypt is fragile. Any movement away from the balancing point means either less ambitious economic development or depletion of the resources and degradation of the environment. The continuing revolution in computer hardware and software is expected to provide more insight into the water problems and to alleviate some of the future water crises. In this paper we have investigated potential benefits which can be accrued from the application of object-oriented modeling in water resources.     

Optimal Operation of Reservoir Systems using Simulated Annealing

A stochastic search technique, simulated annealing (SA), is used to optimize the operation of multiple reservoirs. Seminal application of annealing technique in general to multi-period, multiple-reservoir systems, along with problem representation and selection of different parameter values used in the annealing algorithm for specific cases is discussed. The search technique is improved with the help of heuristic rules, problem-specific information and concepts from the field of evolutionary algorithms. The technique is tested for application to a benchmark problem of four-reservoir system previously solved using a linear programming formulation and its ability to replicate the global optimum solution is examined. The technique is also applied to a system of four hydropower generating reservoirs in Manitoba, Canada, to derive optimal operating rules. A limited version of this problem is solved using a mixed integer nonlinear programming and results are compared with those obtained using SA. A better objective function value is obtained using simulated annealing than the value from a mixed integer non-linear programming model developed for the same problem. Results obtained from these applications suggest that simulated annealing can be used for obtaining near-optimal solutions for multi-period reservoir operation problems that are computationally intractable.     

Identification of Secretory Compounds from the European Callipodidan Species <Emphasis Type="Italic">Apfelbeckia insculpta</Emphasis>

Defensive secretions of the callipodidan species Apfelbeckia insculpta contain a p-cresol as the main component and phenol in traces. This is the first identification of these compounds in a European callipodidan species. The repugnatory glands of A. insculpta are of the spirobolid type and consist of a spherical reservoir, a simple duct, and a valvular cuticular infolding that opens onto the lateral surface of the millipede via a pore.     

Characterizing the structure of pharmaceutical granules obtained by wet granulation with varying amounts of water via Raman chemical imaging

A pharmaceutical formulation containing metformin hydrochloride (MET), hydroxypropyl cellulose (HPC), and microcrystalline cellulose (MCC) was wet granulated with varying amounts of water and the structure of the obtained granules was characterized by Raman chemical mapping. Univariate Raman mapping was found to be satisfactory for producing the images of the two components of interest (HPC and MCC). In addition to the images, the average Raman spectra from the maps as well as the micro-Raman spectra from the hot pixels were analyzed. HPC is found to strongly respond to the addition of water, with its domain dissipating and Raman bands becoming weaker as the water addition increases. MCC is also responsive to water, reacting similarly to HPC but to a much smaller extent and only for the largest amounts of water. Granules made with increasing water content also have improved tabletting properties and flow.