Application of fuzzy sets to manufacturing/distribution planning decisions in supply chains

In the real-world manufacturing/distribution planning decision (MDPD) integration problems in supply chains, the environmental coefficients and parameters are normally imprecise due to incomplete and/or unavailable information. This work presents a fuzzy linear programming approach based on the possibility theory. It applies this approach to solve multi-product and multi-time period MDPD problems with imprecise goals and forecast demand by considering the time value of money of related operating cost categories. The proposed approach attempts to minimize the total manufacturing and distribution costs by considering the levels of inventory, subcontracting and backordering, the available machine capacity and labor levels at each source, forecast demand and available warehouse space at each destination. This study utilizes an industrial case study to demonstrate the feasibility of applying the proposed approach to practical MDPD problems. The primary contribution of this paper is a fuzzy mathematical programming methodology for solving the MDPD integration problems in uncertain environments.     

Conservative and aggressive rough SVR modeling

Support vector regression provides an alternative to the neural networks in modeling non-linear real-world patterns. Rough values, with a lower and upper bound, are needed whenever the variables under consideration cannot be represented by a single value. This paper describes two approaches for the modeling of rough values with support vector regression (SVR). One approach, by attempting to ensure that the predicted high value is not greater than the upper bound and that the predicted low value is not less than the lower bound, is conservative in nature. On the contrary, we also propose an aggressive approach seeking a predicted high which is not less than the upper bound and a predicted low which is not greater than the lower bound. The proposal is shown to use ?-insensitivity to provide a more flexible version of lower and upper possibilistic regression models. The usefulness of our work is realized by modeling the rough pattern of a stock market index, and can be taken advantage of by conservative and aggressive traders.     

Robot Motion Planning: A Game-Theoretic Foundation

Analysis techniques and algorithms for basic path planning have become quite valuable in a variety of applications such as robotics, virtual prototyping, computer graphics, and computational biology. Yet, basic path planning represents a very restricted version of general motion planning problems often encountered in robotics. Many problems can involve complications such as sensing and model uncertainties, nonholonomy, dynamics, multiple robots and goals, optimality criteria, unpredictability, and nonstationarity, in addition to standard geometric workspace constraints. This paper proposes a unified, game-theoretic mathematical foundation upon which analysis and algorithms can be developed for this broader class of problems, and is inspired by the similar benefits that were obtained by using unified configuration-space concepts for basic path planning. By taking this approach, a general algorithm has been obtained for computing approximate optimal solutions to a broad class of motion planning problems, including those involving uncertainty in sensing and control, environment uncertainties, and the coordination of multiple robots. Received November 11, 1996; revised March 13, 1998.     

基于模糊理论的SAR图像分割算法研究与实现

SAR图像存在强烈的相干斑噪声,传统方法不能很好对其分割。文章基于模糊理论,通过选择图像特征,构造模糊集,借助最大隶属度原则进行了SAR图像分割算法的设计,并借助SAR图像分别进行了参数调节和窗口选择的实验,获得了满意的分割结果。实验结果表明,该算法对于SAR图像分割可行有效。     

Emotional agent based on rough set

To improve the ability of agent for handling emotions, a new architecture for emotion agent is presented, based on the traditional BDI agent model and the rough set theory. By a new emotional reasoning algorithm based on rough set, the architecture performs emotion reasoning and implements the emotion treatment. An emotional agent grid based on this architecture has been realized, experiment results show that it is efficient to transact simple emotions by emotional agents.     

Modeling Instrumental Rationality, Land Tenure and Conflict Resolution

Full instrumental rationality and perfect institutions are two cornerstoneassumptions underlying neoclassical models. However, in the real world, thesetwo assumptions never hold, especially not in developing countries. In thispaper, we develop a game theoretical model to investigate if relaxations inthe full instrumental rationality and perfect institutions premise can explainthe conflicts that have been occurring between the various principals in theNarok district in Kenya with regard to land tenure and use.     

Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5

We begin by showing how to faithfully encode the Classical ModalDisplay Logic (CMDL) of Wansing into the Calculus of Structures(CoS) of Guglielmi. Since every CMDL calculus enjoys cut-elimination,we obtain a cut-elimination theorem for all corresponding CoScalculi. We then show how our result leads to a minimal cut-freeCoS calculus for modal logic S5. No other existing CoS calculifor S5 enjoy both these properties simultaneously.     

Dynamics of Flexible Multibody Systems Using Virtual Work and Linear Graph Theory

By combining linear graph theory with the principle of virtualwork, a dynamic formulation is obtained that extends graph-theoreticmodelling methods to the analysis of flexible multibody systems. Thesystem is represented by a linear graph, in which nodes representreference frames on rigid and flexible bodies, and edges representcomponents that connect these frames. By selecting a spanning tree forthe graph, the analyst can choose the set of coordinates appearing inthe final system of equations. This set can include absolute, joint, orelastic coordinates, or some combination thereof. If desired, allnon-working constraint forces and torques can be automaticallyeliminated from the dynamic equations by exploiting the properties ofvirtual work. The formulation has been implemented in a computerprogram, DynaFlex, that generates the equations of motion in symbolicform. Three examples are presented to demonstrate the application of theformulation, and to validate the symbolic computer implementation.     

On the rate of heterogeneous catalytic reactions with ionic intermediates

A facile way to compute the rate law of a catalytic reaction with ionic intermediates is proposed, based on the theory of complex reactions. When the ionic nature of intermediates is taken into account it is necessary to add balance equations which correspond to the electroneutrality of the catalyst. Several mechanisms of the olefin hydrogenation were considered as examples.     

Denotation and connotation in the human – computer interface: The ‘Save as …’ command

This paper presents a semiotic technique as a means of exploring meaning and understanding in interface design and use. This is examined through a study of the interaction between the ‘file’ metaphor and ‘save as’ command metaphor. The behaviour of these (from a functional or computational basis) do not exactly match, or map onto, the meaning of the metaphor. We examine both the denotation of a term to the user, i.e. its literal meaning to that person, and the term's connotations, i.e. any other meanings associated with the term. We suggest that the technique applied is useful in predicting future problems with understanding the use of metaphor at the interface and with designing appropriate signification for human-computer interaction. Variation in connotation was expected but a more fundamental difference in denotation was also uncovered. Moreover, the results clearly demonstrate that consistency in the denotation of a term is critical in achieving a good user understanding of the command.