余热利用系统多目标优化模型及应用

以炭黑生产中的余热利用系统为背景建立了余热利用系统多目标优化规划数学模型;阐述了模型的求解方法;给出了实例分析。     

无约束淬火机目标温度神经网络预报

淬火、控制冷却的冷却速度和目标温度是关系到钢板性能的关键因素 ,但由于冷却过程的水量、水温、辊道速度等对冷却目标温度的影响属多变量非线性过程 ,用简单的解析模型通常精度较低 ,难以达到精确控制的要求。采用人工神经网络技术对无约束淬火机目标温度进行快速预报 ,结果表明 ,预测精度高 ,快速准确     

A multi-objective programming model for scheduling emergency medicine residents

Scheduling emergency medicine residents (EMRs) is a complex task, which considers a large number of rules (often conflicting) related to various aspects such as limits on the number of consecutive work hours, number of day and night shifts that should be worked by each resident, resident staffing requirements according to seniority levels for the day and night shifts, restrictions on the number of consecutive day and night shifts assigned, vacation periods, weekend off requests, and fair distribution of responsibilities among the residents. Emergency rooms (ERs) are stressful workplaces, and in addition shift work is well-known to be more demanding than regular daytime work. For this reason, preparing schedules that suit the working rules for EMRs is especially important for reducing the negative impact on shift workers physiologically, psychologically, and socially. In this paper, we present a goal programming (GP) model that accommodates both hard and soft constraints for a monthly planning horizon. The hard constraints should be adhered to strictly, whereas the soft constraints can be violated when necessary. The relative importance values of the soft constraints have been computed by the analytical hierarchy process (AHP), which are used as coefficients of the deviations from the soft constraints in the objective function. The model has been tested in the ER of a major local university hospital. The main conclusions of the study are that problems of realistic size can be solved quickly and the generated schedules have very high qualities compared to the manually prepared schedules, which require a lot of effort and time from the chief resident who is responsible for this duty.     

多Agent系统的研究

自agent术语引起国内学者重视以来,人们一直试图寻找一个贴切的汉语名词,“代理人”“智能体洲结点”等概念应运而生。但这些概念都不能令人满意,因为无论是“智能体”、“代理人”,还是“结点”,都仅部分地反映了agent的特征,而未完全地反映其本质属性,故本文仍使用agent的英文形式。     

Utilizing deontic operators in information systems specification

One major task in requirements specification is to capture the rules relevant to the problem at hand. Declarative, rule-based approaches have been suggested by many researchers in the field. However, when it comes to modeling large systems of rules, not only for the behavior of the computer system but also for the organizational environment surrounding it, current approaches have problems with limited expressiveness, flexibility, and poor comprehensibility. Hence, rule-based approaches may benefit from improvements in two directions: (1) improvement of the rule languages themselves and (2) better integration with other, complementary modeling approaches.In this article, both issues are addressed in an integrated manner. The proposal is presented in the context of the Tempora project on rule-based information systems development, but has also been integrated with PPP. Tempora has provided a rule language based on an executable temporal logic working on top of a temporal database. The rule language is integrated with static (ER-like) and dynamic (SA/RT-like) modeling approaches. In the current proposal, the integration with complementary modeling approaches is extended by including organization modeling (actors, roles), and the expressiveness of the rule language is increased by introducing deontic operators and rule hierarchies. The main contribution of the article is not seen as any one of the above-mentioned extensions, but as the resulting comprehensive modeling support. The approach is illustrated by examples taken from an industrial case study done in connection with Tempora.C. List of Symbols Subset of set - Not subset of set - Element of set - Not element of set - Equivalent to - Not equivalent to - ¬ Negation - Logical and - Logical or - Implication - Sometime in past - Sometime in future - Always in past - Always in future - Just before - Just after - u Until - s Since - Trigger - Condition - _s State condition - Consequence - _a Action - _s State - Role - Actor - ¬ - General deontic operator - O Obligatory - R Recommended - P Permitted - D Discouraged - F Forbidden - (/–) General rule - t _R Real time - t _M Model time     

User goals in social virtual worlds: A means-end chain approach

The purpose of this study is twofold: first, to investigate user goals in social virtual worlds; second, to introduce a methodological alternative (i.e., a means-end chain approach) for analyzing user goals in cyberspaces. The data were acquired from a web survey, and were analyzed by means-end chain analysis (MECA), which produces users’ goal structure in reference to a hierarchical system of interrelated goals (Olson & Reynolds, 1983). The results show that people come to social virtual worlds to satisfy their social and hedonic needs, and to escape from real world constraints, as do virtual community members and virtual gamers; they also pursue unique activities, such as creating virtual objects and selling them. On the other hand, by clarifying relations among users’ goals, MECA provides a richer explanation for user goals than prior research which only offers separate user goals for cyberspace users without explanation of relationship among goals.     

A new mathematical programming approach to multi-group classification problems

In this paper we introduce a goal programming formulation for the multi-group classification problem. Although a great number of mathematical programming models for two-group classification problems have been proposed in the literature, there are few mathematical programming models for multi-group classification problems. Newly proposed multi-group mathematical programming model is compared with other conventional multi-group methods by using different real data sets taken from the literature and simulation data. A comparative analysis on the real data sets and simulation data shows that our goal programming formulation may suggest efficient alternative to traditional statistical methods and mathematical programming formulations for the multi-group classification problem.     

An interactive meta-goal programming-based decision analysis methodology to support collaborative manufacturing

Small and Medium Manufacturing Enterprises (SMMEs) show increasing interest in collaborative manufacturing. Since, collaborative manufacturing enables SMMEs to collaboratively, deliver total solutions to globally distributed customers in a highly competitive manner. Engaging in collaborative manufacturing however has been identified as a challenging task for most SMMEs. The complexity of the collaborative decision-making processes impels that challenge to the SMMEs. Thus the focus of this paper is to propose an Interactive Meta-Goal Programming (IMGP)-based decision analysis methodology to help SMMEs overcome this challenge. A major contribution is the improvement of the interaction interface between decision-makers and a Goal Programming decision model. Our methodology enables every functional entity involved in a collaborative manufacturing decision problem to individually analyse and propose its uniquely desired local goals for the concerned decision, and facilitates the application of different prioritised goal clustering schemes to all proposed goals in order to accurately convey the decision-makers’ preferences. Thirdly, meta-goals are used to manipulate the degree of attainment for the prioritised goals. A hypothetical example is provided to illustrate the application of this methodology.     

A probabilistic plan recognition algorithm based on plan tree grammars

We present the PHATT algorithm for plan recognition. Unlike previous approaches to plan recognition, PHATT is based on a model of plan execution. We show that this clarifies several difficult issues in plan recognition including the execution of multiple interleaved root goals, partially ordered plans, and failing to observe actions. We present the PHATT algorithm's theoretical basis, and an implementation based on tree structures. We also investigate the algorithm's complexity, both analytically and empirically. Finally, we present PHATT's integrated constraint reasoning for parametrized actions and temporal constraints.     

一种目标驱动的移动业务流程的分析方法

随着移动互联网的发展,如何改进现有的业务流程来更好地满足用户的需求成为企业普遍面临的问题。然而,对于企业中哪些业务需要移动化以及如何移动化,目前仍然缺乏相应的分析方法。针对该问题,提出一种基于目标的移动业务流程分析方法。该方法认为企业的各个业务流程都是为了满足一定的用户需求,因此提出建立企业业务流程模型与用户需求模型之间的对应关系,然后通过识别移动环境下用户需求的变化来改进企业的业务流程。以一个医院的业务流程为案例说明了所提方法的可行性。