This paper presents two parallel semantics of constraint logic programs: multiset answer constraint semantics and game semantics, which differ entirely from the traditional semantics. When giving the first semantics, ...
详细信息
This paper presents two parallel semantics of constraint logic programs: multiset answer constraint semantics and game semantics, which differ entirely from the traditional semantics. When giving the first semantics, it adopts the s-semantics approach, whose aim is to find notions of models which really capture the operational semantics. And it defines the program equivalence based on multiset answer constraint. Then it investigates the game semantics and proves that it is consistent with traditional operational semantics. On the basis of these two semantics, programmers can comprehend the programs deeply and develop more sound parallel constraint logic programming systems. Finally, it gives the conclusions and future work.
ETL tools are responsible for the extraction of data from sources, their cleansing and loading into a target data warehouse. However, nowadays, the design and development of ETL processes are performed in an in-house ...
详细信息
ETL tools are responsible for the extraction of data from sources, their cleansing and loading into a target data warehouse. However, nowadays, the design and development of ETL processes are performed in an in-house fashion, and need uniformed methodological foundations. In this paper, we propose a novel conceptual model for the modeling of ETL processes. We employ CommonCubes to represent the cubes in a target data warehouse. CommonCubes release the design of ETL processes from overdependence on the physical schema of the target data warehouse, and enable the designers to pay more efforts to data transforming than data loading when designing ETL processes. Based on the constraint functions on source attributes and the transforming operations on target attributes, we define ETL mappings 1:0 capture the semantics of various relationship cardinalities between source attributes and target attributes, which provide a good basis for the design of ETL processes.
This paper presents a new model to incorporate decision theory into Graphplan framework, which enables our planner to handle uncertainty and make decision to choose the optimal one among a set of hypothesis valid plan...
详细信息
This paper presents a new model to incorporate decision theory into Graphplan framework, which enables our planner to handle uncertainty and make decision to choose the optimal one among a set of hypothesis valid plans. This planer, called UTDP is tested on several experimental domains. And the experimental results show that UTGP is sound and efficient and performs better than the famous probabilistic planner Buridan.
The traditional RBAC model already cannot express the complicated secure access control constraint of the workflow. Based on the traditional RBAC model, a new conditioned RBAC model named as CMWRBSAC is proposed on th...
详细信息
The traditional RBAC model already cannot express the complicated secure access control constraint of the workflow. Based on the traditional RBAC model, a new conditioned RBAC model named as CMWRBSAC is proposed on the basis of multi-weighted roles. A conditioned RBAC strategy is discussed on the basis of dynamic role assignment. A new concept of workflow access authorization is defined on the basis of roles with multi-weights, including the hierarchy weight, the degree weight and the sequence weight. Furthermore, in order to solve the problems of the sequence constraint of cooperative activating task by multi-roles and multi-users, a sort algorithm based on token and a sort algorithm based on weighted roles synthesis are presented respectively. Finally, an example is given to show the work processes of these algorithms. This model can express complicated workflow secure access control constraint.
It is well recognized that sequential pattern mining plays an essential role in many scientific and business domains. In this paper, a new extension of sequential pattern, attributes' sequential pattern, is propos...
详细信息
It is well recognized that sequential pattern mining plays an essential role in many scientific and business domains. In this paper, a new extension of sequential pattern, attributes' sequential pattern, is proposed. An attributes' sequential pattern is a sequence of attributes, whose values commonly occur in ascending order over data set. After each record in data set is transformed into an attributes' sequence according to their ordinal values, attributes' sequential patterns can be mined by means of mining sequential patterns. But our work is different from sequential pattern mining. One use of attributes' sequential patterns is to identify possible errors in data set for data cleaning, in which the values of attributes break the attributes' sequential patterns which most of the data conform to. Experiments verify the high efficiency of the method presented.
This paper focuses on spatial query optimization in distributed GIS. A new qualitative spatial relation model and its consistency problem solution which compose topology, direction, distance and size are proposed. Res...
详细信息
This paper presents a Case Based Reasoning (CBR) approach to identifying micro-architecture anti-patterns and replacing them with "good" patterns in order to improve the design of software system. The result...
详细信息
Three kinds of constrained traveling salesman problems (TSP) arising from application problems, namely the open route TSP, the end-fixed TSP, and the path-constrained TSP, are proposed. The corresponding approaches ba...
详细信息
Three kinds of constrained traveling salesman problems (TSP) arising from application problems, namely the open route TSP, the end-fixed TSP, and the path-constrained TSP, are proposed. The corresponding approaches based on modified genetic algorithms (GA) for solving these constrained TSPs are presented. Numerical experiments demonstrate that the algorithm for the open route TSP shows its advantages when the open route is required, the algorithm for the end-fixed TSP can deal with route optimization with constraint of fixed ends effectively, and the algorithm for the path-constraint could benefit the traffic problems where some cities cannot be visited from each other.
Spatio-temporal information process grows up quickly in these years. Although uncertain and multi-granularities is the common features of spatio-temporal data, those problems were not well solved yet. A new spatio-tem...
详细信息
暂无评论