权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

Application System Design based on Constraint Programming Approach

基于约束规划方法的应用系统设计

基本信息

批准号：
10680394
负责人：
KANEDA Shigeo
金额：
$ 1.54万
依托单位：
Doshisha University
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (C)
财政年份：
1998
资助国家：
日本
起止时间：
1998 至 2000
项目状态：
已结题

项目摘要

The major research results are summarized as the followings :1. Constraint ProgrammingThe authors discussed a new type of constraint programming approach for clerical works. Business rules in offices can be easily converted into the constraint programming style. Also, the constraint programming has high modularity and maintenance-ability. A major problem of this approach is applicability for hierarchical data objects in object oriented programming approach. Further research was required to solve this problem. It is considered that XML may be a good solution to resolve the problem of the proposed approach.2. Workflow Design and Investment MeasurementInefficient workflow of clerical business results in hard-programming task in the constraint programming approach. Thus, the authors proposed a new approach to optimize workflow systems using ABC/ABM (Activity-based Costing or Activity-based Management). The proposed method was evaluated experimentally by a real application system developed by IEICE (The Institute of Electronics, Information, and Communication Engineers) and the experimental result shows that the proposed method is practical and effective.3. Constraint Satisfaction and Privacy ProtectionWe clarified that "privacy infringement by information integration" problem is equal to a kind of constraint satisfaction problem. From the viewpoints, some privacy infringement cases through the Internet were discussed. The "constraint satisfaction view" can clarify and analyze the privacy infringement process. However, probabilistic constraint satisfaction approach should be required for the further research.

主要研究成果如下：1.约束程序设计作者讨论了一种新的约束程序设计方法。办公室中的业务规则可以很容易地转换为约束编程风格。同时，约束规划具有较高的模块化和可维护性。这种方法的一个主要问题是适用于面向对象编程方法中的分层数据对象。需要进一步研究来解决这个问题。XML被认为是一个很好的解决方案，以解决所提出的方法的问题.工作流设计与投资度量在约束规划方法中，由于文书业务的工作流效率低下，导致编程任务难以完成。因此，作者提出了一种新的方法来优化工作流系统使用ABC/ABM（作业成本法或作业管理）。通过IEICE（The Institute of Electronics，Information，and Communication Engineers）开发的一个真实的应用系统对所提出的方法进行了实验验证，实验结果表明所提出的方法是实用有效的.约束满足与隐私保护阐明了“信息集成侵犯隐私”问题等价于一类约束满足问题。从这两个角度出发，讨论了一些通过互联网侵犯隐私权的案例。“约束满足观”可以对隐私权侵权过程进行澄清和分析。然而，概率约束满足的方法应该需要进一步的研究。